./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product23.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_product23.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 f91feaa60fbddcfc87f4cdb3911bff4dfabb88b0b67a46a205760e052b15032c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:37:42,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:37:42,621 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:42,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:37:42,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:37:42,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:37:42,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:37:42,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:37:42,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:37:42,642 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:37:42,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:37:42,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:37:42,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:37:42,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:37:42,642 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:37:42,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:37:42,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:37:42,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:37:42,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:37:42,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:37:42,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:37:42,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:37:42,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:37:42,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:37:42,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:37:42,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:37:42,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:37:42,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:37:42,644 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 -> f91feaa60fbddcfc87f4cdb3911bff4dfabb88b0b67a46a205760e052b15032c [2025-02-05 15:37:42,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:37:42,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:37:42,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:37:42,915 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:37:42,915 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:37:42,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c [2025-02-05 15:37:44,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22216aa1b/7d0f79183a3c48c5b164da786bae4dac/FLAG69c2dbd24 [2025-02-05 15:37:44,477 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:37:44,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c [2025-02-05 15:37:44,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22216aa1b/7d0f79183a3c48c5b164da786bae4dac/FLAG69c2dbd24 [2025-02-05 15:37:44,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22216aa1b/7d0f79183a3c48c5b164da786bae4dac [2025-02-05 15:37:44,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:37:44,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:37:44,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:37:44,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:37:44,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:37:44,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:37:44" (1/1) ... [2025-02-05 15:37:44,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa80ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:44, skipping insertion in model container [2025-02-05 15:37:44,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:37:44" (1/1) ... [2025-02-05 15:37:44,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:37:44,747 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_product23.cil.c[5798,5811] [2025-02-05 15:37:45,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:37:45,031 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:37:45,041 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-02-05 15:37:45,047 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [67] [2025-02-05 15:37:45,050 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [260] [2025-02-05 15:37:45,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [269] [2025-02-05 15:37:45,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1874] [2025-02-05 15:37:45,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1968] [2025-02-05 15:37:45,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2086] [2025-02-05 15:37:45,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2124] [2025-02-05 15:37:45,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2472] [2025-02-05 15:37:45,052 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2838] [2025-02-05 15:37:45,065 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_product23.cil.c[5798,5811] [2025-02-05 15:37:45,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:37:45,178 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:37:45,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45 WrapperNode [2025-02-05 15:37:45,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:37:45,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:37:45,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:37:45,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:37:45,186 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:45" (1/1) ... [2025-02-05 15:37:45,204 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:45" (1/1) ... [2025-02-05 15:37:45,233 INFO L138 Inliner]: procedures = 94, calls = 353, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 941 [2025-02-05 15:37:45,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:37:45,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:37:45,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:37:45,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:37:45,240 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:45" (1/1) ... [2025-02-05 15:37:45,240 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:45" (1/1) ... [2025-02-05 15:37:45,245 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:45" (1/1) ... [2025-02-05 15:37:45,276 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:37:45,276 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:45" (1/1) ... [2025-02-05 15:37:45,277 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:45" (1/1) ... [2025-02-05 15:37:45,294 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:45" (1/1) ... [2025-02-05 15:37:45,296 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:45" (1/1) ... [2025-02-05 15:37:45,299 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:45" (1/1) ... [2025-02-05 15:37:45,301 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:45" (1/1) ... [2025-02-05 15:37:45,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:37:45,306 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:37:45,306 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:37:45,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:37:45,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:45,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:37:45,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:45,334 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:45,336 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:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:37:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-02-05 15:37:45,353 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-02-05 15:37:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-02-05 15:37:45,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-02-05 15:37:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:37:45,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:37:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:37:45,354 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:37:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-02-05 15:37:45,354 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-02-05 15:37:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:37:45,354 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:37:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-02-05 15:37:45,354 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-02-05 15:37:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:37:45,354 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:37:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:37:45,354 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:37:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:37:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:37:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:37:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:37:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:37:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:37:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:37:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:37:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:37:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:37:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:37:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:37:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-02-05 15:37:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-02-05 15:37:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:37:45,356 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:37:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:37:45,356 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:37:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-02-05 15:37:45,356 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-02-05 15:37:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:37:45,356 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:37:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:37:45,356 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:37:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:37:45,356 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:37:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:37:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:37:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:37:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:37:45,357 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:37:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:37:45,357 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:37:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:37:45,358 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:37:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:37:45,358 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:37:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-02-05 15:37:45,358 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-02-05 15:37:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:37:45,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:37:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:37:45,358 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:37:45,514 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:37:45,517 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:37:45,582 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1205-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~12#1; [2025-02-05 15:37:45,582 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233: #res#1 := ~retValue_acc~13#1; [2025-02-05 15:37:45,585 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: #res := ~retValue_acc~4; [2025-02-05 15:37:45,607 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2005: #res := ~retValue_acc~19; [2025-02-05 15:37:45,643 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862: #res := ~retValue_acc~17; [2025-02-05 15:37:45,722 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~9#1; [2025-02-05 15:37:45,722 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1115: #res#1 := ~retValue_acc~10#1; [2025-02-05 15:37:45,722 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1149-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~11#1; [2025-02-05 15:37:45,735 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1278: #res := ~retValue_acc~15; [2025-02-05 15:37:45,972 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~14#1; [2025-02-05 15:37:46,029 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~6#1; [2025-02-05 15:37:46,029 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L694-1: isIdle_#res#1 := isIdle_~retValue_acc~7#1; [2025-02-05 15:37:46,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3496: #res := ~retValue_acc~31; [2025-02-05 15:37:46,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2083: #res := ~retValue_acc~21; [2025-02-05 15:37:46,045 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: #res := ~retValue_acc~0; [2025-02-05 15:37:46,047 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L509: #res := ~retValue_acc~1; [2025-02-05 15:37:46,204 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2044: #res := ~retValue_acc~20; [2025-02-05 15:37:46,219 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L552: #res := ~retValue_acc~3; [2025-02-05 15:37:46,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3185: #res := ~retValue_acc~30; [2025-02-05 15:37:46,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1046: #res := ~retValue_acc~8; [2025-02-05 15:37:46,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2121-1: valid_product_#res#1 := valid_product_~retValue_acc~23#1; [2025-02-05 15:37:46,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2469-1: main_#res#1 := main_~retValue_acc~25#1; [2025-02-05 15:37:46,428 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2949: #res := ~retValue_acc~29; [2025-02-05 15:37:46,576 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2025-02-05 15:37:46,576 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:37:46,592 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:37:46,592 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:37:46,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:37:46 BoogieIcfgContainer [2025-02-05 15:37:46,593 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:37:46,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:37:46,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:37:46,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:37:46,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:37:44" (1/3) ... [2025-02-05 15:37:46,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7754fba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:37:46, skipping insertion in model container [2025-02-05 15:37:46,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (2/3) ... [2025-02-05 15:37:46,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7754fba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:37:46, skipping insertion in model container [2025-02-05 15:37:46,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:37:46" (3/3) ... [2025-02-05 15:37:46,599 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product23.cil.c [2025-02-05 15:37:46,609 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:37:46,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product23.cil.c that has 29 procedures, 612 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:37:46,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:37:46,686 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;@2cd02cf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:37:46,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:37:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 612 states, 468 states have (on average 1.6602564102564104) internal successors, (777), 487 states have internal predecessors, (777), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-05 15:37:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:37:46,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:46,713 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] [2025-02-05 15:37:46,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:46,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1550551462, now seen corresponding path program 1 times [2025-02-05 15:37:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:46,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116337278] [2025-02-05 15:37:46,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:46,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:46,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:37:46,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:37:46,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:46,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:47,363 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:47,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:47,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116337278] [2025-02-05 15:37:47,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116337278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:47,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:47,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:47,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568251527] [2025-02-05 15:37:47,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:47,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:47,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:47,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:47,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:47,388 INFO L87 Difference]: Start difference. First operand has 612 states, 468 states have (on average 1.6602564102564104) internal successors, (777), 487 states have internal predecessors, (777), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:47,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:47,602 INFO L93 Difference]: Finished difference Result 1221 states and 2018 transitions. [2025-02-05 15:37:47,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:47,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2025-02-05 15:37:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:47,621 INFO L225 Difference]: With dead ends: 1221 [2025-02-05 15:37:47,621 INFO L226 Difference]: Without dead ends: 616 [2025-02-05 15:37:47,631 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:47,634 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 91 mSDsluCounter, 4859 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5848 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:47,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5848 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-02-05 15:37:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2025-02-05 15:37:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 471 states have (on average 1.653927813163482) internal successors, (779), 489 states have internal predecessors, (779), 114 states have call successors, (114), 28 states have call predecessors, (114), 28 states have return successors, (113), 109 states have call predecessors, (113), 111 states have call successors, (113) [2025-02-05 15:37:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1006 transitions. [2025-02-05 15:37:47,733 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1006 transitions. Word has length 115 [2025-02-05 15:37:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:47,734 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 1006 transitions. [2025-02-05 15:37:47,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1006 transitions. [2025-02-05 15:37:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:37:47,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:47,743 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] [2025-02-05 15:37:47,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:37:47,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:47,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1008501857, now seen corresponding path program 1 times [2025-02-05 15:37:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:47,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951871788] [2025-02-05 15:37:47,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:47,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:37:47,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:37:47,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:47,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:47,939 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:47,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:47,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951871788] [2025-02-05 15:37:47,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951871788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:47,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:47,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:47,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759404170] [2025-02-05 15:37:47,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:47,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:47,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:47,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:47,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:47,943 INFO L87 Difference]: Start difference. First operand 614 states and 1006 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:48,015 INFO L93 Difference]: Finished difference Result 1210 states and 1993 transitions. [2025-02-05 15:37:48,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:48,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-02-05 15:37:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:48,022 INFO L225 Difference]: With dead ends: 1210 [2025-02-05 15:37:48,022 INFO L226 Difference]: Without dead ends: 590 [2025-02-05 15:37:48,025 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:48,026 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 14 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2923 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:48,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2923 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:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-02-05 15:37:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-02-05 15:37:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 450 states have (on average 1.6444444444444444) internal successors, (740), 466 states have internal predecessors, (740), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:37:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 963 transitions. [2025-02-05 15:37:48,063 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 963 transitions. Word has length 116 [2025-02-05 15:37:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:48,064 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 963 transitions. [2025-02-05 15:37:48,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 963 transitions. [2025-02-05 15:37:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:37:48,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:48,073 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] [2025-02-05 15:37:48,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:37:48,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:48,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1595390558, now seen corresponding path program 1 times [2025-02-05 15:37:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:48,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443450505] [2025-02-05 15:37:48,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:48,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:37:48,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:37:48,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:48,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:48,358 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:48,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:48,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443450505] [2025-02-05 15:37:48,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443450505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:48,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:48,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:48,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096706895] [2025-02-05 15:37:48,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:48,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:48,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:48,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:48,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:48,359 INFO L87 Difference]: Start difference. First operand 590 states and 963 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:48,455 INFO L93 Difference]: Finished difference Result 1173 states and 1925 transitions. [2025-02-05 15:37:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:48,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2025-02-05 15:37:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:48,461 INFO L225 Difference]: With dead ends: 1173 [2025-02-05 15:37:48,461 INFO L226 Difference]: Without dead ends: 584 [2025-02-05 15:37:48,465 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:48,466 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 77 mSDsluCounter, 4690 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5642 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:48,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5642 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:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-02-05 15:37:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2025-02-05 15:37:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 444 states have (on average 1.6373873873873874) internal successors, (727), 460 states have internal predecessors, (727), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:37:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 950 transitions. [2025-02-05 15:37:48,497 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 950 transitions. Word has length 116 [2025-02-05 15:37:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:48,497 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 950 transitions. [2025-02-05 15:37:48,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:48,498 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 950 transitions. [2025-02-05 15:37:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:37:48,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:48,503 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] [2025-02-05 15:37:48,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:37:48,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:48,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:48,505 INFO L85 PathProgramCache]: Analyzing trace with hash 725589940, now seen corresponding path program 1 times [2025-02-05 15:37:48,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:48,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462785126] [2025-02-05 15:37:48,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:48,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:37:48,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:37:48,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:48,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:48,718 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:48,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:48,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462785126] [2025-02-05 15:37:48,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462785126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:48,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:48,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:48,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821529703] [2025-02-05 15:37:48,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:48,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:48,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:48,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:48,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:48,721 INFO L87 Difference]: Start difference. First operand 584 states and 950 transitions. 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:48,801 INFO L93 Difference]: Finished difference Result 1161 states and 1899 transitions. [2025-02-05 15:37:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:48,802 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2025-02-05 15:37:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:48,805 INFO L225 Difference]: With dead ends: 1161 [2025-02-05 15:37:48,806 INFO L226 Difference]: Without dead ends: 578 [2025-02-05 15:37:48,808 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:48,810 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 63 mSDsluCounter, 4642 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5582 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:48,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5582 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:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-05 15:37:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-02-05 15:37:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 438 states have (on average 1.63013698630137) internal successors, (714), 454 states have internal predecessors, (714), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:37:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 937 transitions. [2025-02-05 15:37:48,839 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 937 transitions. Word has length 117 [2025-02-05 15:37:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:48,839 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 937 transitions. [2025-02-05 15:37:48,839 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 937 transitions. [2025-02-05 15:37:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:37:48,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:48,842 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] [2025-02-05 15:37:48,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:37:48,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:48,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash -922433476, now seen corresponding path program 1 times [2025-02-05 15:37:48,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505285828] [2025-02-05 15:37:48,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:48,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:37:48,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:37:48,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:48,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,035 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:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505285828] [2025-02-05 15:37:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505285828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166455856] [2025-02-05 15:37:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:49,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:49,038 INFO L87 Difference]: Start difference. First operand 578 states and 937 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,100 INFO L93 Difference]: Finished difference Result 1149 states and 1873 transitions. [2025-02-05 15:37:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:49,101 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 118 [2025-02-05 15:37:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,104 INFO L225 Difference]: With dead ends: 1149 [2025-02-05 15:37:49,104 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:37:49,108 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:49,108 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 49 mSDsluCounter, 4594 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5522 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:49,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5522 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:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:37:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:37:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6226851851851851) internal successors, (701), 448 states have internal predecessors, (701), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:37:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 924 transitions. [2025-02-05 15:37:49,135 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 924 transitions. Word has length 118 [2025-02-05 15:37:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:49,136 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 924 transitions. [2025-02-05 15:37:49,136 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 924 transitions. [2025-02-05 15:37:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:37:49,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:49,140 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] [2025-02-05 15:37:49,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:37:49,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:49,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1028136844, now seen corresponding path program 1 times [2025-02-05 15:37:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784192929] [2025-02-05 15:37:49,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:49,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:37:49,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:37:49,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:49,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,313 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:49,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784192929] [2025-02-05 15:37:49,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784192929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505194859] [2025-02-05 15:37:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:49,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:49,315 INFO L87 Difference]: Start difference. First operand 572 states and 924 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,373 INFO L93 Difference]: Finished difference Result 1137 states and 1847 transitions. [2025-02-05 15:37:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:49,374 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 118 [2025-02-05 15:37:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,377 INFO L225 Difference]: With dead ends: 1137 [2025-02-05 15:37:49,377 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:37:49,380 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:49,380 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 24 mSDsluCounter, 4558 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5474 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:49,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5474 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:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:37:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:37:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6203703703703705) internal successors, (700), 448 states have internal predecessors, (700), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:37:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 923 transitions. [2025-02-05 15:37:49,399 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 923 transitions. Word has length 118 [2025-02-05 15:37:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:49,400 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 923 transitions. [2025-02-05 15:37:49,400 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 923 transitions. [2025-02-05 15:37:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:37:49,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:49,403 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] [2025-02-05 15:37:49,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:37:49,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:49,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1055526642, now seen corresponding path program 1 times [2025-02-05 15:37:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:49,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293291322] [2025-02-05 15:37:49,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:49,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:37:49,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:37:49,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:49,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,516 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:49,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293291322] [2025-02-05 15:37:49,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293291322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952144884] [2025-02-05 15:37:49,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:49,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:49,517 INFO L87 Difference]: Start difference. First operand 572 states and 923 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,561 INFO L93 Difference]: Finished difference Result 1128 states and 1832 transitions. [2025-02-05 15:37:49,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:49,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-02-05 15:37:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,565 INFO L225 Difference]: With dead ends: 1128 [2025-02-05 15:37:49,565 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:37:49,568 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:49,569 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 15 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2709 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:49,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2709 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:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:37:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:37:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6180555555555556) internal successors, (699), 448 states have internal predecessors, (699), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:37:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 922 transitions. [2025-02-05 15:37:49,589 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 922 transitions. Word has length 119 [2025-02-05 15:37:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:49,589 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 922 transitions. [2025-02-05 15:37:49,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 922 transitions. [2025-02-05 15:37:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:37:49,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:49,592 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] [2025-02-05 15:37:49,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:37:49,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash 941233156, now seen corresponding path program 1 times [2025-02-05 15:37:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639149458] [2025-02-05 15:37:49,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:49,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:37:49,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:37:49,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:49,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,733 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:49,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639149458] [2025-02-05 15:37:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639149458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878513517] [2025-02-05 15:37:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:49,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:49,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:49,735 INFO L87 Difference]: Start difference. First operand 572 states and 922 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,775 INFO L93 Difference]: Finished difference Result 1128 states and 1830 transitions. [2025-02-05 15:37:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2025-02-05 15:37:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,779 INFO L225 Difference]: With dead ends: 1128 [2025-02-05 15:37:49,779 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:37:49,782 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:49,782 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 14 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2711 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:49,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2711 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:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:37:49,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:37:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6157407407407407) internal successors, (698), 448 states have internal predecessors, (698), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:37:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 921 transitions. [2025-02-05 15:37:49,800 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 921 transitions. Word has length 120 [2025-02-05 15:37:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:49,800 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 921 transitions. [2025-02-05 15:37:49,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 921 transitions. [2025-02-05 15:37:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:37:49,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:49,802 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] [2025-02-05 15:37:49,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:37:49,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:49,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:49,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1265316689, now seen corresponding path program 1 times [2025-02-05 15:37:49,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:49,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620623353] [2025-02-05 15:37:49,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:49,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:37:49,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:37:49,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:49,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,925 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:49,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620623353] [2025-02-05 15:37:49,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620623353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:49,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574229505] [2025-02-05 15:37:49,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:49,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:49,927 INFO L87 Difference]: Start difference. First operand 572 states and 921 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,971 INFO L93 Difference]: Finished difference Result 1128 states and 1828 transitions. [2025-02-05 15:37:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:49,972 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2025-02-05 15:37:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,976 INFO L225 Difference]: With dead ends: 1128 [2025-02-05 15:37:49,976 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:37:49,979 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:49,980 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 13 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2713 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:49,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2713 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:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:37:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:37:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6134259259259258) internal successors, (697), 448 states have internal predecessors, (697), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:37:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 920 transitions. [2025-02-05 15:37:50,002 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 920 transitions. Word has length 121 [2025-02-05 15:37:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:50,002 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 920 transitions. [2025-02-05 15:37:50,003 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 920 transitions. [2025-02-05 15:37:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:37:50,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:50,006 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] [2025-02-05 15:37:50,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:37:50,006 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:50,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1276043559, now seen corresponding path program 1 times [2025-02-05 15:37:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:50,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107946857] [2025-02-05 15:37:50,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:50,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:37:50,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:37:50,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:50,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:50,116 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:50,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:50,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107946857] [2025-02-05 15:37:50,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107946857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:50,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:50,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:50,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34337265] [2025-02-05 15:37:50,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:50,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:50,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:50,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:50,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:50,118 INFO L87 Difference]: Start difference. First operand 572 states and 920 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:50,160 INFO L93 Difference]: Finished difference Result 1128 states and 1826 transitions. [2025-02-05 15:37:50,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:50,161 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-02-05 15:37:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:50,165 INFO L225 Difference]: With dead ends: 1128 [2025-02-05 15:37:50,165 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:37:50,168 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:50,169 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 12 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2715 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:50,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2715 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:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:37:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:37:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6111111111111112) internal successors, (696), 448 states have internal predecessors, (696), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:37:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 919 transitions. [2025-02-05 15:37:50,193 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 919 transitions. Word has length 122 [2025-02-05 15:37:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:50,194 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 919 transitions. [2025-02-05 15:37:50,194 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 919 transitions. [2025-02-05 15:37:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:37:50,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:50,198 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] [2025-02-05 15:37:50,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:37:50,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:50,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash 162648468, now seen corresponding path program 1 times [2025-02-05 15:37:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:50,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126115380] [2025-02-05 15:37:50,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:50,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:50,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:37:50,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:37:50,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:50,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:50,344 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:50,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:50,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126115380] [2025-02-05 15:37:50,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126115380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:50,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61824651] [2025-02-05 15:37:50,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:50,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:50,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:50,350 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:50,351 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:50,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:37:50,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:37:50,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:50,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:50,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:37:50,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:50,768 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:50,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:50,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61824651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:50,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:50,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:37:50,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004576782] [2025-02-05 15:37:50,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:50,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:50,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:50,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:50,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:50,770 INFO L87 Difference]: Start difference. First operand 572 states and 919 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:50,828 INFO L93 Difference]: Finished difference Result 1627 states and 2645 transitions. [2025-02-05 15:37:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:50,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 123 [2025-02-05 15:37:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:50,834 INFO L225 Difference]: With dead ends: 1627 [2025-02-05 15:37:50,834 INFO L226 Difference]: Without dead ends: 1073 [2025-02-05 15:37:50,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 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:50,837 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 842 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 2390 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:50,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 2390 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:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-02-05 15:37:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1058. [2025-02-05 15:37:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 806 states have (on average 1.6228287841191067) internal successors, (1308), 837 states have internal predecessors, (1308), 201 states have call successors, (201), 51 states have call predecessors, (201), 50 states have return successors, (203), 195 states have call predecessors, (203), 198 states have call successors, (203) [2025-02-05 15:37:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1712 transitions. [2025-02-05 15:37:50,874 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1712 transitions. Word has length 123 [2025-02-05 15:37:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:50,874 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1712 transitions. [2025-02-05 15:37:50,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:50,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1712 transitions. [2025-02-05 15:37:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:37:50,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:50,878 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] [2025-02-05 15:37:50,887 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:51,079 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:51,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:51,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash 249631560, now seen corresponding path program 1 times [2025-02-05 15:37:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:51,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269708048] [2025-02-05 15:37:51,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:51,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:37:51,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:37:51,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:51,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:51,239 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:51,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269708048] [2025-02-05 15:37:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269708048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136942085] [2025-02-05 15:37:51,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:51,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:51,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:51,242 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:51,249 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:51,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:37:51,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:37:51,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:51,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:51,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:37:51,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:51,644 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:51,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:51,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136942085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:51,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:51,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:37:51,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603767780] [2025-02-05 15:37:51,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:51,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:51,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:51,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:51,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:51,646 INFO L87 Difference]: Start difference. First operand 1058 states and 1712 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:51,715 INFO L93 Difference]: Finished difference Result 2599 states and 4233 transitions. [2025-02-05 15:37:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:51,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-02-05 15:37:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:51,725 INFO L225 Difference]: With dead ends: 2599 [2025-02-05 15:37:51,725 INFO L226 Difference]: Without dead ends: 1559 [2025-02-05 15:37:51,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 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:51,731 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 843 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 2447 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:51,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 2447 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:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-02-05 15:37:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1511. [2025-02-05 15:37:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1153 states have (on average 1.6339982653946228) internal successors, (1884), 1199 states have internal predecessors, (1884), 286 states have call successors, (286), 71 states have call predecessors, (286), 71 states have return successors, (293), 279 states have call predecessors, (293), 283 states have call successors, (293) [2025-02-05 15:37:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2463 transitions. [2025-02-05 15:37:51,788 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2463 transitions. Word has length 124 [2025-02-05 15:37:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:51,789 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2463 transitions. [2025-02-05 15:37:51,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2463 transitions. [2025-02-05 15:37:51,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:37:51,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:51,795 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] [2025-02-05 15:37:51,807 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:51,999 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:52,000 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:52,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1833470413, now seen corresponding path program 1 times [2025-02-05 15:37:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:52,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69171786] [2025-02-05 15:37:52,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:52,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:37:52,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:37:52,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:52,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:52,223 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:52,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69171786] [2025-02-05 15:37:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69171786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:52,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:52,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:52,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003093948] [2025-02-05 15:37:52,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:52,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:52,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:52,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:52,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:52,225 INFO L87 Difference]: Start difference. First operand 1511 states and 2463 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:37:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:52,836 INFO L93 Difference]: Finished difference Result 4457 states and 7396 transitions. [2025-02-05 15:37:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:52,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 126 [2025-02-05 15:37:52,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:52,865 INFO L225 Difference]: With dead ends: 4457 [2025-02-05 15:37:52,866 INFO L226 Difference]: Without dead ends: 2964 [2025-02-05 15:37:52,879 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:52,880 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 910 mSDsluCounter, 3671 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 4692 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:52,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 4692 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:37:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2025-02-05 15:37:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2917. [2025-02-05 15:37:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2227 states have (on average 1.633587786259542) internal successors, (3638), 2315 states have internal predecessors, (3638), 551 states have call successors, (551), 136 states have call predecessors, (551), 138 states have return successors, (637), 543 states have call predecessors, (637), 547 states have call successors, (637) [2025-02-05 15:37:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4826 transitions. [2025-02-05 15:37:53,046 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4826 transitions. Word has length 126 [2025-02-05 15:37:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:53,047 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 4826 transitions. [2025-02-05 15:37:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:37:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4826 transitions. [2025-02-05 15:37:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:37:53,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:53,055 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:53,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:37:53,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:53,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2106061788, now seen corresponding path program 1 times [2025-02-05 15:37:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:53,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524785027] [2025-02-05 15:37:53,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:53,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:37:53,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:37:53,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:53,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:53,276 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:53,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:53,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524785027] [2025-02-05 15:37:53,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524785027] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:53,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328805889] [2025-02-05 15:37:53,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:53,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:53,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:53,284 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:53,286 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:53,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:37:53,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:37:53,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:53,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:53,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:37:53,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:53,800 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:53,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:53,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328805889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:53,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:53,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-05 15:37:53,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163210189] [2025-02-05 15:37:53,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:53,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:53,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:53,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:53,804 INFO L87 Difference]: Start difference. First operand 2917 states and 4826 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:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:54,577 INFO L93 Difference]: Finished difference Result 7916 states and 13308 transitions. [2025-02-05 15:37:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:54,578 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:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:54,611 INFO L225 Difference]: With dead ends: 7916 [2025-02-05 15:37:54,612 INFO L226 Difference]: Without dead ends: 5017 [2025-02-05 15:37:54,637 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:54,637 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 777 mSDsluCounter, 3232 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 4117 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:54,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 4117 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:37:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2025-02-05 15:37:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4974. [2025-02-05 15:37:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4974 states, 3792 states have (on average 1.5864978902953586) internal successors, (6016), 3938 states have internal predecessors, (6016), 930 states have call successors, (930), 246 states have call predecessors, (930), 251 states have return successors, (1183), 919 states have call predecessors, (1183), 924 states have call successors, (1183) [2025-02-05 15:37:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4974 states to 4974 states and 8129 transitions. [2025-02-05 15:37:54,894 INFO L78 Accepts]: Start accepts. Automaton has 4974 states and 8129 transitions. Word has length 127 [2025-02-05 15:37:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:54,894 INFO L471 AbstractCegarLoop]: Abstraction has 4974 states and 8129 transitions. [2025-02-05 15:37:54,897 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:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4974 states and 8129 transitions. [2025-02-05 15:37:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:37:54,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:54,903 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:54,912 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:55,104 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:55,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:55,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 261750444, now seen corresponding path program 1 times [2025-02-05 15:37:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:55,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609037442] [2025-02-05 15:37:55,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:55,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:55,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:37:55,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:37:55,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:55,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:55,178 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:55,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:55,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609037442] [2025-02-05 15:37:55,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609037442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:55,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:55,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006617055] [2025-02-05 15:37:55,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:55,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:55,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:55,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:55,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:55,180 INFO L87 Difference]: Start difference. First operand 4974 states and 8129 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:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:55,437 INFO L93 Difference]: Finished difference Result 9954 states and 16433 transitions. [2025-02-05 15:37:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:55,438 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:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:55,561 INFO L225 Difference]: With dead ends: 9954 [2025-02-05 15:37:55,561 INFO L226 Difference]: Without dead ends: 4998 [2025-02-05 15:37:55,583 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:55,584 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 12 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:55,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2679 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2025-02-05 15:37:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4982. [2025-02-05 15:37:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4982 states, 3798 states have (on average 1.5850447604002107) internal successors, (6020), 3944 states have internal predecessors, (6020), 930 states have call successors, (930), 250 states have call predecessors, (930), 253 states have return successors, (1172), 917 states have call predecessors, (1172), 924 states have call successors, (1172) [2025-02-05 15:37:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 8122 transitions. [2025-02-05 15:37:55,775 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 8122 transitions. Word has length 127 [2025-02-05 15:37:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:55,776 INFO L471 AbstractCegarLoop]: Abstraction has 4982 states and 8122 transitions. [2025-02-05 15:37:55,777 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:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 8122 transitions. [2025-02-05 15:37:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:37:55,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:55,782 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:55,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:37:55,782 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1456592072, now seen corresponding path program 1 times [2025-02-05 15:37:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108874347] [2025-02-05 15:37:55,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:55,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:37:55,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:37:55,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:55,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:55,935 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:55,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:55,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108874347] [2025-02-05 15:37:55,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108874347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:55,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:55,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390817458] [2025-02-05 15:37:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:55,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:55,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:55,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:55,937 INFO L87 Difference]: Start difference. First operand 4982 states and 8122 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:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:56,659 INFO L93 Difference]: Finished difference Result 14879 states and 25017 transitions. [2025-02-05 15:37:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:56,660 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:56,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:56,721 INFO L225 Difference]: With dead ends: 14879 [2025-02-05 15:37:56,722 INFO L226 Difference]: Without dead ends: 9915 [2025-02-05 15:37:56,750 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:56,751 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 903 mSDsluCounter, 3587 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 4577 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:56,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 4577 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:37:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9915 states. [2025-02-05 15:37:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9915 to 9846. [2025-02-05 15:37:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9846 states, 7508 states have (on average 1.5808470964304742) internal successors, (11869), 7794 states have internal predecessors, (11869), 1832 states have call successors, (1832), 494 states have call predecessors, (1832), 505 states have return successors, (2726), 1817 states have call predecessors, (2726), 1822 states have call successors, (2726) [2025-02-05 15:37:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 16427 transitions. [2025-02-05 15:37:57,105 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 16427 transitions. Word has length 135 [2025-02-05 15:37:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:57,106 INFO L471 AbstractCegarLoop]: Abstraction has 9846 states and 16427 transitions. [2025-02-05 15:37:57,106 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:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 16427 transitions. [2025-02-05 15:37:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:37:57,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:57,110 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:57,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:37:57,110 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:57,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:57,110 INFO L85 PathProgramCache]: Analyzing trace with hash 355737613, now seen corresponding path program 1 times [2025-02-05 15:37:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828271893] [2025-02-05 15:37:57,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:57,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:37:57,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:37:57,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:57,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:57,175 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:57,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:57,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828271893] [2025-02-05 15:37:57,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828271893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:57,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:57,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986649942] [2025-02-05 15:37:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:57,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:57,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:57,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:57,177 INFO L87 Difference]: Start difference. First operand 9846 states and 16427 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:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:57,602 INFO L93 Difference]: Finished difference Result 19746 states and 33427 transitions. [2025-02-05 15:37:57,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:57,603 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:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:57,660 INFO L225 Difference]: With dead ends: 19746 [2025-02-05 15:37:57,661 INFO L226 Difference]: Without dead ends: 9918 [2025-02-05 15:37:57,724 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:57,725 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 12 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:57,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2670 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9918 states. [2025-02-05 15:37:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9918 to 9886. [2025-02-05 15:37:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9886 states, 7544 states have (on average 1.5786055143160127) internal successors, (11909), 7822 states have internal predecessors, (11909), 1832 states have call successors, (1832), 510 states have call predecessors, (1832), 509 states have return successors, (2710), 1813 states have call predecessors, (2710), 1822 states have call successors, (2710) [2025-02-05 15:37:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9886 states to 9886 states and 16451 transitions. [2025-02-05 15:37:58,157 INFO L78 Accepts]: Start accepts. Automaton has 9886 states and 16451 transitions. Word has length 136 [2025-02-05 15:37:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:58,157 INFO L471 AbstractCegarLoop]: Abstraction has 9886 states and 16451 transitions. [2025-02-05 15:37:58,158 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:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 9886 states and 16451 transitions. [2025-02-05 15:37:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:37:58,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:58,163 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:58,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:37:58,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:58,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1173756249, now seen corresponding path program 1 times [2025-02-05 15:37:58,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:58,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716662039] [2025-02-05 15:37:58,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:58,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:37:58,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:37:58,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:58,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:58,309 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:58,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:58,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716662039] [2025-02-05 15:37:58,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716662039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:58,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:58,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:58,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704056410] [2025-02-05 15:37:58,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:58,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:58,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:58,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:58,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:58,311 INFO L87 Difference]: Start difference. First operand 9886 states and 16451 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:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:59,197 INFO L93 Difference]: Finished difference Result 29669 states and 51595 transitions. [2025-02-05 15:37:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:59,198 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:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:59,307 INFO L225 Difference]: With dead ends: 29669 [2025-02-05 15:37:59,308 INFO L226 Difference]: Without dead ends: 19801 [2025-02-05 15:37:59,374 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:59,375 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 899 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 4583 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:59,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 4583 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:37:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19801 states. [2025-02-05 15:37:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19801 to 19700. [2025-02-05 15:37:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19700 states, 15036 states have (on average 1.5750864591646714) internal successors, (23683), 15586 states have internal predecessors, (23683), 3642 states have call successors, (3642), 1014 states have call predecessors, (3642), 1021 states have return successors, (6611), 3619 states have call predecessors, (6611), 3624 states have call successors, (6611) [2025-02-05 15:38:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19700 states to 19700 states and 33936 transitions. [2025-02-05 15:38:00,173 INFO L78 Accepts]: Start accepts. Automaton has 19700 states and 33936 transitions. Word has length 145 [2025-02-05 15:38:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:00,174 INFO L471 AbstractCegarLoop]: Abstraction has 19700 states and 33936 transitions. [2025-02-05 15:38:00,174 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:38:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 19700 states and 33936 transitions. [2025-02-05 15:38:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:38:00,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:00,179 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:38:00,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:38:00,180 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:00,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1199598061, now seen corresponding path program 1 times [2025-02-05 15:38:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:00,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243010022] [2025-02-05 15:38:00,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:00,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:38:00,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:38:00,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:00,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:00,244 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:38:00,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243010022] [2025-02-05 15:38:00,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243010022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:00,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:00,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:00,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449076469] [2025-02-05 15:38:00,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:00,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:00,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:00,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:00,246 INFO L87 Difference]: Start difference. First operand 19700 states and 33936 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:38:01,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:01,104 INFO L93 Difference]: Finished difference Result 39526 states and 69656 transitions. [2025-02-05 15:38:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:01,105 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:38:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:01,240 INFO L225 Difference]: With dead ends: 39526 [2025-02-05 15:38:01,241 INFO L226 Difference]: Without dead ends: 19844 [2025-02-05 15:38:01,554 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:38:01,554 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 11 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:01,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2670 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19844 states. [2025-02-05 15:38:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19844 to 19780. [2025-02-05 15:38:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19780 states, 15108 states have (on average 1.5728752978554408) internal successors, (23763), 15658 states have internal predecessors, (23763), 3642 states have call successors, (3642), 1030 states have call predecessors, (3642), 1029 states have return successors, (6591), 3611 states have call predecessors, (6591), 3624 states have call successors, (6591) [2025-02-05 15:38:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19780 states to 19780 states and 33996 transitions. [2025-02-05 15:38:02,505 INFO L78 Accepts]: Start accepts. Automaton has 19780 states and 33996 transitions. Word has length 146 [2025-02-05 15:38:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:02,506 INFO L471 AbstractCegarLoop]: Abstraction has 19780 states and 33996 transitions. [2025-02-05 15:38:02,506 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:38:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 19780 states and 33996 transitions. [2025-02-05 15:38:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 15:38:02,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:02,512 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:38:02,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:38:02,513 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:02,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1699975760, now seen corresponding path program 1 times [2025-02-05 15:38:02,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:02,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906030626] [2025-02-05 15:38:02,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:02,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:02,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 15:38:02,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 15:38:02,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:02,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:02,677 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:38:02,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:02,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906030626] [2025-02-05 15:38:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906030626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675174842] [2025-02-05 15:38:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:02,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:02,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:02,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:02,679 INFO L87 Difference]: Start difference. First operand 19780 states and 33996 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:38:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:04,554 INFO L93 Difference]: Finished difference Result 59477 states and 109285 transitions. [2025-02-05 15:38:04,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:04,554 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:38:04,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:04,854 INFO L225 Difference]: With dead ends: 59477 [2025-02-05 15:38:04,855 INFO L226 Difference]: Without dead ends: 39715 [2025-02-05 15:38:05,013 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:38:05,015 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 893 mSDsluCounter, 3700 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 4721 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:05,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 4721 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 15:38:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2025-02-05 15:38:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 39550. [2025-02-05 15:38:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39550 states, 30212 states have (on average 1.570402489077188) internal successors, (47445), 31306 states have internal predecessors, (47445), 7268 states have call successors, (7268), 2054 states have call predecessors, (7268), 2069 states have return successors, (16832), 7229 states have call predecessors, (16832), 7234 states have call successors, (16832) [2025-02-05 15:38:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39550 states to 39550 states and 71545 transitions. [2025-02-05 15:38:07,342 INFO L78 Accepts]: Start accepts. Automaton has 39550 states and 71545 transitions. Word has length 156 [2025-02-05 15:38:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:07,343 INFO L471 AbstractCegarLoop]: Abstraction has 39550 states and 71545 transitions. [2025-02-05 15:38:07,343 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:38:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states and 71545 transitions. [2025-02-05 15:38:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 15:38:07,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:07,350 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:38:07,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:38:07,351 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:07,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1582732125, now seen corresponding path program 1 times [2025-02-05 15:38:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624949677] [2025-02-05 15:38:07,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:07,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 15:38:07,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 15:38:07,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:07,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:07,458 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:38:07,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:07,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624949677] [2025-02-05 15:38:07,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624949677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:07,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:07,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:07,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862265361] [2025-02-05 15:38:07,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:07,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:07,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:07,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:07,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:07,461 INFO L87 Difference]: Start difference. First operand 39550 states and 71545 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:38:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:09,664 INFO L93 Difference]: Finished difference Result 79402 states and 148817 transitions. [2025-02-05 15:38:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:09,664 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:38:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:10,153 INFO L225 Difference]: With dead ends: 79402 [2025-02-05 15:38:10,153 INFO L226 Difference]: Without dead ends: 39870 [2025-02-05 15:38:10,697 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:38:10,698 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 10 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:10,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2670 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39870 states. [2025-02-05 15:38:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39870 to 39742. [2025-02-05 15:38:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39742 states, 30388 states have (on average 1.5676253784388574) internal successors, (47637), 31482 states have internal predecessors, (47637), 7268 states have call successors, (7268), 2086 states have call predecessors, (7268), 2085 states have return successors, (16816), 7213 states have call predecessors, (16816), 7234 states have call successors, (16816) [2025-02-05 15:38:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39742 states to 39742 states and 71721 transitions. [2025-02-05 15:38:12,688 INFO L78 Accepts]: Start accepts. Automaton has 39742 states and 71721 transitions. Word has length 157 [2025-02-05 15:38:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:12,689 INFO L471 AbstractCegarLoop]: Abstraction has 39742 states and 71721 transitions. [2025-02-05 15:38:12,689 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:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 39742 states and 71721 transitions. [2025-02-05 15:38:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 15:38:12,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:12,696 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:12,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:38:12,697 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:12,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1376741121, now seen corresponding path program 1 times [2025-02-05 15:38:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658308513] [2025-02-05 15:38:12,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:12,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:38:12,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:38:12,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:12,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:13,037 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:13,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658308513] [2025-02-05 15:38:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658308513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462994970] [2025-02-05 15:38:13,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:13,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:13,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:13,040 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:38:13,042 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:38:13,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:38:13,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:38:13,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:13,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:13,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 1750 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:38:13,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 15:38:13,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462994970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:13,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:13,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:38:13,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078264860] [2025-02-05 15:38:13,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:13,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:38:13,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:13,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:38:13,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:13,316 INFO L87 Difference]: Start difference. First operand 39742 states and 71721 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 15:38:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:16,485 INFO L93 Difference]: Finished difference Result 118063 states and 216639 transitions. [2025-02-05 15:38:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:38:16,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2025-02-05 15:38:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:17,291 INFO L225 Difference]: With dead ends: 118063 [2025-02-05 15:38:17,291 INFO L226 Difference]: Without dead ends: 78370 [2025-02-05 15:38:17,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 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:38:17,677 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 905 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1823 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:38:17,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1823 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78370 states. [2025-02-05 15:38:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78370 to 77805. [2025-02-05 15:38:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77805 states, 59686 states have (on average 1.5709546627349797) internal successors, (93764), 61759 states have internal predecessors, (93764), 14049 states have call successors, (14049), 4038 states have call predecessors, (14049), 4069 states have return successors, (33271), 14055 states have call predecessors, (33271), 13983 states have call successors, (33271) [2025-02-05 15:38:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77805 states to 77805 states and 141084 transitions. [2025-02-05 15:38:21,729 INFO L78 Accepts]: Start accepts. Automaton has 77805 states and 141084 transitions. Word has length 168 [2025-02-05 15:38:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:21,730 INFO L471 AbstractCegarLoop]: Abstraction has 77805 states and 141084 transitions. [2025-02-05 15:38:21,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 15:38:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 77805 states and 141084 transitions. [2025-02-05 15:38:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 15:38:21,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:21,735 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:21,743 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:38:21,936 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,SelfDestructingSolverStorable21 [2025-02-05 15:38:21,936 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:21,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1083338114, now seen corresponding path program 1 times [2025-02-05 15:38:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:21,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036368519] [2025-02-05 15:38:21,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:21,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:38:21,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:38:21,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:21,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:22,073 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:22,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:22,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036368519] [2025-02-05 15:38:22,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036368519] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:22,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498062181] [2025-02-05 15:38:22,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:22,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:22,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:22,076 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:38:22,077 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:38:22,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:38:22,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:38:22,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:22,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:22,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:38:22,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:22,426 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:22,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:22,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498062181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:22,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:22,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-05 15:38:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579935315] [2025-02-05 15:38:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:22,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:22,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:22,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:22,427 INFO L87 Difference]: Start difference. First operand 77805 states and 141084 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) [2025-02-05 15:38:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:29,054 INFO L93 Difference]: Finished difference Result 191315 states and 371571 transitions. [2025-02-05 15:38:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:29,055 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 168 [2025-02-05 15:38:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:30,377 INFO L225 Difference]: With dead ends: 191315 [2025-02-05 15:38:30,378 INFO L226 Difference]: Without dead ends: 113480 [2025-02-05 15:38:31,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:38:31,358 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 903 mSDsluCounter, 3288 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 4197 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:31,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 4197 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:38:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113480 states.