./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product11.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_spec9_product11.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 2156ba1e79a86c856553f139302f2b9940a34efa4e31eb139d6bea893c29b00d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:38:31,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:38:31,548 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:38:31,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:38:31,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:38:31,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:38:31,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:38:31,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:38:31,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:38:31,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:38:31,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:38:31,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:38:31,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:38:31,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:38:31,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:38:31,589 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:38:31,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:38:31,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:38:31,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:38:31,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:38:31,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:38:31,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:38:31,591 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 -> 2156ba1e79a86c856553f139302f2b9940a34efa4e31eb139d6bea893c29b00d [2025-02-05 15:38:31,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:38:31,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:38:31,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:38:31,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:38:31,896 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:38:31,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c [2025-02-05 15:38:33,266 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb51ffd2/60f84788137946b09626d864972373d7/FLAG9643bff15 [2025-02-05 15:38:33,609 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:38:33,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c [2025-02-05 15:38:33,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb51ffd2/60f84788137946b09626d864972373d7/FLAG9643bff15 [2025-02-05 15:38:33,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb51ffd2/60f84788137946b09626d864972373d7 [2025-02-05 15:38:33,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:38:33,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:38:33,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:38:33,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:38:33,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:38:33,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:38:33" (1/1) ... [2025-02-05 15:38:33,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64231e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:33, skipping insertion in model container [2025-02-05 15:38:33,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:38:33" (1/1) ... [2025-02-05 15:38:33,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:38:34,201 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_spec9_product11.cil.c[71954,71967] [2025-02-05 15:38:34,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:38:34,217 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:38:34,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-02-05 15:38:34,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [148] [2025-02-05 15:38:34,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [505] [2025-02-05 15:38:34,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [871] [2025-02-05 15:38:34,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1034] [2025-02-05 15:38:34,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1069] [2025-02-05 15:38:34,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1189] [2025-02-05 15:38:34,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1201] [2025-02-05 15:38:34,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2729] [2025-02-05 15:38:34,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3390] [2025-02-05 15:38:34,346 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_spec9_product11.cil.c[71954,71967] [2025-02-05 15:38:34,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:38:34,375 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:38:34,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34 WrapperNode [2025-02-05 15:38:34,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:38:34,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:38:34,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:38:34,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:38:34,382 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:38:34" (1/1) ... [2025-02-05 15:38:34,406 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:38:34" (1/1) ... [2025-02-05 15:38:34,456 INFO L138 Inliner]: procedures = 93, calls = 335, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 1084 [2025-02-05 15:38:34,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:38:34,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:38:34,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:38:34,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:38:34,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (1/1) ... [2025-02-05 15:38:34,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (1/1) ... [2025-02-05 15:38:34,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (1/1) ... [2025-02-05 15:38:34,507 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:38:34,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (1/1) ... [2025-02-05 15:38:34,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (1/1) ... [2025-02-05 15:38:34,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (1/1) ... [2025-02-05 15:38:34,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (1/1) ... [2025-02-05 15:38:34,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (1/1) ... [2025-02-05 15:38:34,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (1/1) ... [2025-02-05 15:38:34,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:38:34,563 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:38:34,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:38:34,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:38:34,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (1/1) ... [2025-02-05 15:38:34,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:38:34,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:34,598 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:38:34,601 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:38:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:38:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:38:34,623 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:38:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:38:34,623 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:38:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-02-05 15:38:34,623 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-02-05 15:38:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:38:34,623 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:38:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:38:34,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:38:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:38:34,624 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:38:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:38:34,624 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:38:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:38:34,624 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:38:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:38:34,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:38:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:38:34,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:38:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:38:34,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:38:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:38:34,625 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:38:34,625 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-02-05 15:38:34,625 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:38:34,625 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:38:34,625 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:38:34,625 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:38:34,625 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-02-05 15:38:34,625 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:38:34,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:38:34,626 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:38:34,626 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:38:34,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:38:34,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:38:34,626 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:38:34,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:38:34,824 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:38:34,828 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:38:34,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1186: #res := ~retValue_acc~9; [2025-02-05 15:38:34,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1280: #res := ~retValue_acc~10; [2025-02-05 15:38:34,914 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1433: #res := ~retValue_acc~11; [2025-02-05 15:38:35,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2089: #res#1 := ~retValue_acc~21#1; [2025-02-05 15:38:35,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1476-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~13#1; [2025-02-05 15:38:35,025 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2717: #res := ~retValue_acc~25; [2025-02-05 15:38:35,360 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1970-1: stopRequestedInDirection__wrappee__empty_#res#1 := stopRequestedInDirection__wrappee__empty_~retValue_acc~18#1; [2025-02-05 15:38:35,360 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1999: #res#1 := ~retValue_acc~19#1; [2025-02-05 15:38:35,426 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2134: #res := ~retValue_acc~23; [2025-02-05 15:38:35,446 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1147: #res := ~retValue_acc~8; [2025-02-05 15:38:35,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525: #res := ~retValue_acc~15; [2025-02-05 15:38:35,590 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1605-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-02-05 15:38:35,591 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-02-05 15:38:35,728 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1442-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2025-02-05 15:38:35,728 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2120-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~22#1; [2025-02-05 15:38:35,787 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3076: #res := ~retValue_acc~28; [2025-02-05 15:38:35,856 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L502-1: main_#res#1 := main_~retValue_acc~1#1; [2025-02-05 15:38:35,856 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-02-05 15:38:35,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: #res := ~retValue_acc~27; [2025-02-05 15:38:35,871 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3387: #res := ~retValue_acc~29; [2025-02-05 15:38:36,034 INFO L? ?]: Removed 437 outVars from TransFormulas that were not future-live. [2025-02-05 15:38:36,034 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:38:36,054 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:38:36,055 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:38:36,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:38:36 BoogieIcfgContainer [2025-02-05 15:38:36,055 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:38:36,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:38:36,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:38:36,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:38:36,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:38:33" (1/3) ... [2025-02-05 15:38:36,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3143a64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:38:36, skipping insertion in model container [2025-02-05 15:38:36,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:34" (2/3) ... [2025-02-05 15:38:36,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3143a64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:38:36, skipping insertion in model container [2025-02-05 15:38:36,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:38:36" (3/3) ... [2025-02-05 15:38:36,065 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product11.cil.c [2025-02-05 15:38:36,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:38:36,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product11.cil.c that has 24 procedures, 545 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:38:36,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:38:36,170 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;@4f565413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:38:36,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:38:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 428 states have (on average 1.6985981308411215) internal successors, (727), 450 states have internal predecessors, (727), 91 states have call successors, (91), 23 states have call predecessors, (91), 23 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:38:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:38:36,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:36,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:36,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:36,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1074689111, now seen corresponding path program 1 times [2025-02-05 15:38:36,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:36,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631169263] [2025-02-05 15:38:36,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:36,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:38:36,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:38:36,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:36,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631169263] [2025-02-05 15:38:36,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631169263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:36,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:36,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574267639] [2025-02-05 15:38:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:36,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:36,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:36,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:36,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:36,994 INFO L87 Difference]: Start difference. First operand has 545 states, 428 states have (on average 1.6985981308411215) internal successors, (727), 450 states have internal predecessors, (727), 91 states have call successors, (91), 23 states have call predecessors, (91), 23 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:37,171 INFO L93 Difference]: Finished difference Result 1070 states and 1792 transitions. [2025-02-05 15:38:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:37,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 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:38:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:37,188 INFO L225 Difference]: With dead ends: 1070 [2025-02-05 15:38:37,189 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:38:37,200 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:38:37,202 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 5 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:37,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2663 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:38:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-05 15:38:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 422 states have (on average 1.6919431279620853) internal successors, (714), 441 states have internal predecessors, (714), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 891 transitions. [2025-02-05 15:38:37,291 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 891 transitions. Word has length 122 [2025-02-05 15:38:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:37,292 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 891 transitions. [2025-02-05 15:38:37,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 891 transitions. [2025-02-05 15:38:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:38:37,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:37,301 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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:38:37,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:38:37,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:37,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1331463330, now seen corresponding path program 1 times [2025-02-05 15:38:37,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:37,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777388665] [2025-02-05 15:38:37,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:37,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:37,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:38:37,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:38:37,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:37,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:37,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:37,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777388665] [2025-02-05 15:38:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777388665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794703034] [2025-02-05 15:38:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:37,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:37,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:37,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:37,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:37,558 INFO L87 Difference]: Start difference. First operand 536 states and 891 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, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:37,632 INFO L93 Difference]: Finished difference Result 1054 states and 1759 transitions. [2025-02-05 15:38:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:37,632 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, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-02-05 15:38:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:37,638 INFO L225 Difference]: With dead ends: 1054 [2025-02-05 15:38:37,638 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:38:37,641 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:38:37,642 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 4 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:37,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2636 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:38:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-05 15:38:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 422 states have (on average 1.6895734597156398) internal successors, (713), 441 states have internal predecessors, (713), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 890 transitions. [2025-02-05 15:38:37,671 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 890 transitions. Word has length 123 [2025-02-05 15:38:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:37,672 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 890 transitions. [2025-02-05 15:38:37,672 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, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 890 transitions. [2025-02-05 15:38:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:38:37,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:37,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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:38:37,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:38:37,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:37,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash -864266540, now seen corresponding path program 1 times [2025-02-05 15:38:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358193034] [2025-02-05 15:38:37,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:37,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:38:37,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:38:37,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:37,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:37,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358193034] [2025-02-05 15:38:37,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358193034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:37,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857742913] [2025-02-05 15:38:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:37,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:37,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:37,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:37,889 INFO L87 Difference]: Start difference. First operand 536 states and 890 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:37,967 INFO L93 Difference]: Finished difference Result 1054 states and 1758 transitions. [2025-02-05 15:38:37,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:37,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-02-05 15:38:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:37,974 INFO L225 Difference]: With dead ends: 1054 [2025-02-05 15:38:37,974 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:38:37,978 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:38:37,979 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 3 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2636 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:38:37,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2636 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:38:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-05 15:38:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 422 states have (on average 1.6872037914691944) internal successors, (712), 441 states have internal predecessors, (712), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 889 transitions. [2025-02-05 15:38:38,013 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 889 transitions. Word has length 124 [2025-02-05 15:38:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:38,014 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 889 transitions. [2025-02-05 15:38:38,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 889 transitions. [2025-02-05 15:38:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:38:38,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:38,020 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:38,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:38:38,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:38,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1778211841, now seen corresponding path program 1 times [2025-02-05 15:38:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:38,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350488618] [2025-02-05 15:38:38,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:38,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:38:38,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:38:38,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:38,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:38,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350488618] [2025-02-05 15:38:38,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350488618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:38,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:38,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:38,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997666254] [2025-02-05 15:38:38,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:38,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:38,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:38,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:38,257 INFO L87 Difference]: Start difference. First operand 536 states and 889 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:38,320 INFO L93 Difference]: Finished difference Result 1054 states and 1757 transitions. [2025-02-05 15:38:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2025-02-05 15:38:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:38,327 INFO L225 Difference]: With dead ends: 1054 [2025-02-05 15:38:38,327 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:38:38,330 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:38:38,331 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 2 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:38,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2636 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:38:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-05 15:38:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 422 states have (on average 1.6848341232227488) internal successors, (711), 441 states have internal predecessors, (711), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 888 transitions. [2025-02-05 15:38:38,363 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 888 transitions. Word has length 125 [2025-02-05 15:38:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:38,364 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 888 transitions. [2025-02-05 15:38:38,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 888 transitions. [2025-02-05 15:38:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:38:38,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:38,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:38,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:38:38,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:38,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:38,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1611541167, now seen corresponding path program 1 times [2025-02-05 15:38:38,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:38,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363206897] [2025-02-05 15:38:38,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:38,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:38,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:38:38,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:38:38,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:38,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:38,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:38,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363206897] [2025-02-05 15:38:38,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363206897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:38,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:38,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:38,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040140093] [2025-02-05 15:38:38,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:38,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:38,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:38,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:38,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:38,546 INFO L87 Difference]: Start difference. First operand 536 states and 888 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:38,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:38,598 INFO L93 Difference]: Finished difference Result 1054 states and 1756 transitions. [2025-02-05 15:38:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:38,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-02-05 15:38:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:38,607 INFO L225 Difference]: With dead ends: 1054 [2025-02-05 15:38:38,607 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:38:38,610 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:38:38,611 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:38,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2636 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:38:38,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-05 15:38:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 422 states have (on average 1.6824644549763033) internal successors, (710), 441 states have internal predecessors, (710), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 887 transitions. [2025-02-05 15:38:38,650 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 887 transitions. Word has length 126 [2025-02-05 15:38:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:38,651 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 887 transitions. [2025-02-05 15:38:38,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 887 transitions. [2025-02-05 15:38:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:38:38,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:38,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:38,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:38:38,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:38,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:38,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1989453660, now seen corresponding path program 1 times [2025-02-05 15:38:38,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:38,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924563205] [2025-02-05 15:38:38,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:38,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:38,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:38:38,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:38:38,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:38,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:38,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:38,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924563205] [2025-02-05 15:38:38,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924563205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:38,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:38,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:38:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016495497] [2025-02-05 15:38:38,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:38,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:38:38,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:38,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:38:38,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:38,978 INFO L87 Difference]: Start difference. First operand 536 states and 887 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:38:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:39,126 INFO L93 Difference]: Finished difference Result 1020 states and 1688 transitions. [2025-02-05 15:38:39,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:38:39,130 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-02-05 15:38:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:39,136 INFO L225 Difference]: With dead ends: 1020 [2025-02-05 15:38:39,137 INFO L226 Difference]: Without dead ends: 551 [2025-02-05 15:38:39,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:39,141 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 91 mSDsluCounter, 6042 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6917 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:39,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6917 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-02-05 15:38:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2025-02-05 15:38:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 432 states have (on average 1.6782407407407407) internal successors, (725), 453 states have internal predecessors, (725), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2025-02-05 15:38:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 906 transitions. [2025-02-05 15:38:39,175 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 906 transitions. Word has length 127 [2025-02-05 15:38:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:39,175 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 906 transitions. [2025-02-05 15:38:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:38:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 906 transitions. [2025-02-05 15:38:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:38:39,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:39,183 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:39,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:38:39,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:39,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1223705349, now seen corresponding path program 1 times [2025-02-05 15:38:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:39,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100337695] [2025-02-05 15:38:39,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:39,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:39,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:38:39,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:38:39,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:39,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:39,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:39,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100337695] [2025-02-05 15:38:39,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100337695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:39,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:39,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685939278] [2025-02-05 15:38:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:39,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:39,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:39,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:39,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:39,314 INFO L87 Difference]: Start difference. First operand 549 states and 906 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:39,382 INFO L93 Difference]: Finished difference Result 1072 states and 1782 transitions. [2025-02-05 15:38:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-02-05 15:38:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:39,388 INFO L225 Difference]: With dead ends: 1072 [2025-02-05 15:38:39,388 INFO L226 Difference]: Without dead ends: 530 [2025-02-05 15:38:39,390 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:38:39,391 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 0 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:39,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2638 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-02-05 15:38:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-02-05 15:38:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 416 states have (on average 1.6730769230769231) internal successors, (696), 435 states have internal predecessors, (696), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 873 transitions. [2025-02-05 15:38:39,415 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 873 transitions. Word has length 127 [2025-02-05 15:38:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:39,416 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 873 transitions. [2025-02-05 15:38:39,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 873 transitions. [2025-02-05 15:38:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:38:39,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:39,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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:38:39,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:38:39,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:39,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1298468233, now seen corresponding path program 1 times [2025-02-05 15:38:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:39,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928466802] [2025-02-05 15:38:39,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:39,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:38:39,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:38:39,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:39,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:39,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:39,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928466802] [2025-02-05 15:38:39,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928466802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:39,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517920272] [2025-02-05 15:38:39,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:39,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:39,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:39,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:39,616 INFO L87 Difference]: Start difference. First operand 530 states and 873 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:39,832 INFO L93 Difference]: Finished difference Result 1017 states and 1680 transitions. [2025-02-05 15:38:39,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:38:39,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2025-02-05 15:38:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:39,839 INFO L225 Difference]: With dead ends: 1017 [2025-02-05 15:38:39,839 INFO L226 Difference]: Without dead ends: 539 [2025-02-05 15:38:39,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:39,843 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 55 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4121 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:39,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4121 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:38:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-05 15:38:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 530. [2025-02-05 15:38:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 416 states have (on average 1.6634615384615385) internal successors, (692), 435 states have internal predecessors, (692), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 869 transitions. [2025-02-05 15:38:39,884 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 869 transitions. Word has length 128 [2025-02-05 15:38:39,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:39,885 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 869 transitions. [2025-02-05 15:38:39,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 869 transitions. [2025-02-05 15:38:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:38:39,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:39,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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:38:39,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:38:39,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:39,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1421524653, now seen corresponding path program 1 times [2025-02-05 15:38:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:39,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822240992] [2025-02-05 15:38:39,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:39,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:38:39,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:38:39,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:39,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822240992] [2025-02-05 15:38:40,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822240992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:40,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:40,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171559193] [2025-02-05 15:38:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:40,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:40,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:40,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:40,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:40,090 INFO L87 Difference]: Start difference. First operand 530 states and 869 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:40,279 INFO L93 Difference]: Finished difference Result 1017 states and 1676 transitions. [2025-02-05 15:38:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:38:40,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-02-05 15:38:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:40,285 INFO L225 Difference]: With dead ends: 1017 [2025-02-05 15:38:40,285 INFO L226 Difference]: Without dead ends: 539 [2025-02-05 15:38:40,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:40,289 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 54 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4121 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:40,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4121 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-05 15:38:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 530. [2025-02-05 15:38:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 416 states have (on average 1.6538461538461537) internal successors, (688), 435 states have internal predecessors, (688), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 865 transitions. [2025-02-05 15:38:40,313 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 865 transitions. Word has length 129 [2025-02-05 15:38:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:40,314 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 865 transitions. [2025-02-05 15:38:40,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 865 transitions. [2025-02-05 15:38:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:38:40,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:40,318 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:40,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:38:40,319 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:40,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash -100465588, now seen corresponding path program 1 times [2025-02-05 15:38:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:40,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199156489] [2025-02-05 15:38:40,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:40,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:38:40,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:38:40,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:40,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:40,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:40,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199156489] [2025-02-05 15:38:40,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199156489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:40,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:40,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:40,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721594240] [2025-02-05 15:38:40,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:40,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:40,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:40,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:40,511 INFO L87 Difference]: Start difference. First operand 530 states and 865 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:40,684 INFO L93 Difference]: Finished difference Result 1017 states and 1672 transitions. [2025-02-05 15:38:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:38:40,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-02-05 15:38:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:40,692 INFO L225 Difference]: With dead ends: 1017 [2025-02-05 15:38:40,692 INFO L226 Difference]: Without dead ends: 539 [2025-02-05 15:38:40,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:40,696 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 53 mSDsluCounter, 3274 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:40,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4103 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-05 15:38:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 530. [2025-02-05 15:38:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 416 states have (on average 1.6442307692307692) internal successors, (684), 435 states have internal predecessors, (684), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 861 transitions. [2025-02-05 15:38:40,726 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 861 transitions. Word has length 130 [2025-02-05 15:38:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:40,729 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 861 transitions. [2025-02-05 15:38:40,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 861 transitions. [2025-02-05 15:38:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:38:40,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:40,736 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:40,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:38:40,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:40,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash -49199045, now seen corresponding path program 1 times [2025-02-05 15:38:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:40,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878534406] [2025-02-05 15:38:40,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:40,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:38:40,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:38:40,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:40,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:40,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:40,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878534406] [2025-02-05 15:38:40,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878534406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:40,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:40,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:40,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868688378] [2025-02-05 15:38:40,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:40,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:40,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:40,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:40,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:40,942 INFO L87 Difference]: Start difference. First operand 530 states and 861 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:38:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:41,012 INFO L93 Difference]: Finished difference Result 1008 states and 1654 transitions. [2025-02-05 15:38:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:41,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 130 [2025-02-05 15:38:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:41,018 INFO L225 Difference]: With dead ends: 1008 [2025-02-05 15:38:41,018 INFO L226 Difference]: Without dead ends: 509 [2025-02-05 15:38:41,020 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:38:41,021 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 84 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5027 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:41,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5027 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-05 15:38:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-02-05 15:38:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 395 states have (on average 1.6455696202531647) internal successors, (650), 414 states have internal predecessors, (650), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 827 transitions. [2025-02-05 15:38:41,043 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 827 transitions. Word has length 130 [2025-02-05 15:38:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:41,043 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 827 transitions. [2025-02-05 15:38:41,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:38:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 827 transitions. [2025-02-05 15:38:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:38:41,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:41,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:41,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:38:41,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:41,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1939152374, now seen corresponding path program 1 times [2025-02-05 15:38:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:41,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909460429] [2025-02-05 15:38:41,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:41,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:41,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:38:41,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:38:41,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:41,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:41,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:41,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909460429] [2025-02-05 15:38:41,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909460429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:41,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:41,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747827277] [2025-02-05 15:38:41,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:41,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:41,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:41,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:41,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:41,208 INFO L87 Difference]: Start difference. First operand 509 states and 827 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:41,286 INFO L93 Difference]: Finished difference Result 987 states and 1620 transitions. [2025-02-05 15:38:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:38:41,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-02-05 15:38:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:41,294 INFO L225 Difference]: With dead ends: 987 [2025-02-05 15:38:41,294 INFO L226 Difference]: Without dead ends: 509 [2025-02-05 15:38:41,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:41,297 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 17 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4041 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:41,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4041 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-05 15:38:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-02-05 15:38:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 395 states have (on average 1.6430379746835444) internal successors, (649), 414 states have internal predecessors, (649), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 826 transitions. [2025-02-05 15:38:41,320 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 826 transitions. Word has length 131 [2025-02-05 15:38:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:41,321 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 826 transitions. [2025-02-05 15:38:41,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 826 transitions. [2025-02-05 15:38:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:38:41,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:41,325 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:41,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:38:41,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:41,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash 484292367, now seen corresponding path program 1 times [2025-02-05 15:38:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170326892] [2025-02-05 15:38:41,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:41,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:41,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:38:41,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:38:41,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:41,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:41,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:41,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170326892] [2025-02-05 15:38:41,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170326892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:41,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:41,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:41,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742737601] [2025-02-05 15:38:41,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:41,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:41,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:41,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:41,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:41,497 INFO L87 Difference]: Start difference. First operand 509 states and 826 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:41,574 INFO L93 Difference]: Finished difference Result 987 states and 1619 transitions. [2025-02-05 15:38:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:38:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-02-05 15:38:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:41,580 INFO L225 Difference]: With dead ends: 987 [2025-02-05 15:38:41,580 INFO L226 Difference]: Without dead ends: 509 [2025-02-05 15:38:41,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:41,584 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 16 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4041 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:41,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4041 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-05 15:38:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-02-05 15:38:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 395 states have (on average 1.6405063291139241) internal successors, (648), 414 states have internal predecessors, (648), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 825 transitions. [2025-02-05 15:38:41,606 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 825 transitions. Word has length 132 [2025-02-05 15:38:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:41,606 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 825 transitions. [2025-02-05 15:38:41,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 825 transitions. [2025-02-05 15:38:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:38:41,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:41,611 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:41,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:38:41,612 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:41,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1925202279, now seen corresponding path program 1 times [2025-02-05 15:38:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:41,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622140633] [2025-02-05 15:38:41,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:41,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:38:41,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:38:41,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:41,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:38:41,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:41,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622140633] [2025-02-05 15:38:41,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622140633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:41,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:41,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:38:41,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785312197] [2025-02-05 15:38:41,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:41,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:38:41,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:41,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:38:41,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:41,933 INFO L87 Difference]: Start difference. First operand 509 states and 825 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:38:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:42,056 INFO L93 Difference]: Finished difference Result 981 states and 1607 transitions. [2025-02-05 15:38:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:38:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2025-02-05 15:38:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:42,063 INFO L225 Difference]: With dead ends: 981 [2025-02-05 15:38:42,063 INFO L226 Difference]: Without dead ends: 509 [2025-02-05 15:38:42,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:42,068 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 6 mSDsluCounter, 6450 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7259 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:42,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7259 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-05 15:38:42,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-02-05 15:38:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 395 states have (on average 1.6379746835443039) internal successors, (647), 414 states have internal predecessors, (647), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:38:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 824 transitions. [2025-02-05 15:38:42,090 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 824 transitions. Word has length 133 [2025-02-05 15:38:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:42,091 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 824 transitions. [2025-02-05 15:38:42,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:38:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 824 transitions. [2025-02-05 15:38:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:38:42,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:42,097 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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:38:42,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:38:42,098 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:42,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2141089278, now seen corresponding path program 1 times [2025-02-05 15:38:42,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:42,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740514595] [2025-02-05 15:38:42,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:42,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:38:42,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:38:42,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:42,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:38:42,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:42,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740514595] [2025-02-05 15:38:42,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740514595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:42,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194316131] [2025-02-05 15:38:42,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:42,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:42,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:42,257 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:38:42,259 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:38:42,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:38:42,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:38:42,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:42,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:42,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 1507 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:38:42,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:38:42,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194316131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:38:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30963973] [2025-02-05 15:38:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:38:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:42,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:38:42,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:42,726 INFO L87 Difference]: Start difference. First operand 509 states and 824 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:42,789 INFO L93 Difference]: Finished difference Result 1428 states and 2369 transitions. [2025-02-05 15:38:42,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:38:42,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-02-05 15:38:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:42,799 INFO L225 Difference]: With dead ends: 1428 [2025-02-05 15:38:42,799 INFO L226 Difference]: Without dead ends: 964 [2025-02-05 15:38:42,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 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:42,802 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 792 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:42,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1702 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-02-05 15:38:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2025-02-05 15:38:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 748 states have (on average 1.660427807486631) internal successors, (1242), 781 states have internal predecessors, (1242), 172 states have call successors, (172), 41 states have call predecessors, (172), 41 states have return successors, (177), 165 states have call predecessors, (177), 167 states have call successors, (177) [2025-02-05 15:38:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1591 transitions. [2025-02-05 15:38:42,849 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1591 transitions. Word has length 134 [2025-02-05 15:38:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:42,850 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1591 transitions. [2025-02-05 15:38:42,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1591 transitions. [2025-02-05 15:38:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:38:42,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:42,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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:42,865 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:38:43,055 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,SelfDestructingSolverStorable14 [2025-02-05 15:38:43,056 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:43,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1949427660, now seen corresponding path program 1 times [2025-02-05 15:38:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:43,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222750810] [2025-02-05 15:38:43,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:43,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:38:43,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:38:43,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:43,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:38:43,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222750810] [2025-02-05 15:38:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222750810] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220865732] [2025-02-05 15:38:43,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:43,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:43,234 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:38:43,238 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:38:43,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:38:43,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:38:43,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:43,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:43,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:38:43,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:38:43,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:43,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220865732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:43,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:43,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:38:43,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666615092] [2025-02-05 15:38:43,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:43,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:38:43,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:43,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:38:43,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:43,668 INFO L87 Difference]: Start difference. First operand 962 states and 1591 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:43,762 INFO L93 Difference]: Finished difference Result 2789 states and 4688 transitions. [2025-02-05 15:38:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:38:43,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-02-05 15:38:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:43,783 INFO L225 Difference]: With dead ends: 2789 [2025-02-05 15:38:43,783 INFO L226 Difference]: Without dead ends: 1872 [2025-02-05 15:38:43,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 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:43,791 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 791 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:43,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1664 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-02-05 15:38:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1869. [2025-02-05 15:38:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1455 states have (on average 1.6721649484536083) internal successors, (2433), 1516 states have internal predecessors, (2433), 334 states have call successors, (334), 77 states have call predecessors, (334), 79 states have return successors, (371), 327 states have call predecessors, (371), 329 states have call successors, (371) [2025-02-05 15:38:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 3138 transitions. [2025-02-05 15:38:43,903 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 3138 transitions. Word has length 135 [2025-02-05 15:38:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:43,906 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 3138 transitions. [2025-02-05 15:38:43,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 3138 transitions. [2025-02-05 15:38:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:38:43,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:43,912 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:43,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:38:44,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:38:44,116 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:44,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash -302888580, now seen corresponding path program 1 times [2025-02-05 15:38:44,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:44,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904995765] [2025-02-05 15:38:44,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:44,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:44,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:38:44,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:38:44,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:44,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:38:44,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904995765] [2025-02-05 15:38:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904995765] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788754636] [2025-02-05 15:38:44,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:44,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:44,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:44,266 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:38:44,268 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:38:44,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:38:44,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:38:44,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:44,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:44,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:38:44,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:38:44,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:44,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788754636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:44,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:44,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:38:44,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820286613] [2025-02-05 15:38:44,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:44,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:38:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:44,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:38:44,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:44,726 INFO L87 Difference]: Start difference. First operand 1869 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:44,879 INFO L93 Difference]: Finished difference Result 5512 states and 9380 transitions. [2025-02-05 15:38:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:38:44,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-02-05 15:38:44,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:44,916 INFO L225 Difference]: With dead ends: 5512 [2025-02-05 15:38:44,917 INFO L226 Difference]: Without dead ends: 3688 [2025-02-05 15:38:44,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 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:44,931 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 790 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:44,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1655 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2025-02-05 15:38:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3684. [2025-02-05 15:38:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3684 states, 2870 states have (on average 1.6777003484320558) internal successors, (4815), 2987 states have internal predecessors, (4815), 658 states have call successors, (658), 149 states have call predecessors, (658), 155 states have return successors, (795), 651 states have call predecessors, (795), 653 states have call successors, (795) [2025-02-05 15:38:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 6268 transitions. [2025-02-05 15:38:45,172 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 6268 transitions. Word has length 136 [2025-02-05 15:38:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:45,173 INFO L471 AbstractCegarLoop]: Abstraction has 3684 states and 6268 transitions. [2025-02-05 15:38:45,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 6268 transitions. [2025-02-05 15:38:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:38:45,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:45,179 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:45,189 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:38:45,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:45,380 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:45,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:45,381 INFO L85 PathProgramCache]: Analyzing trace with hash -799788434, now seen corresponding path program 1 times [2025-02-05 15:38:45,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:45,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097694166] [2025-02-05 15:38:45,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:45,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:45,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:38:45,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:38:45,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:45,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:38:45,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:45,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097694166] [2025-02-05 15:38:45,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097694166] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:45,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057897928] [2025-02-05 15:38:45,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:45,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:45,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:45,545 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:45,548 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:45,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:38:45,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:38:45,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:45,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:45,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:38:45,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:38:45,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:45,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057897928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:45,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:38:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398882310] [2025-02-05 15:38:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:45,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:38:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:45,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:38:45,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:45,966 INFO L87 Difference]: Start difference. First operand 3684 states and 6268 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:46,251 INFO L93 Difference]: Finished difference Result 10959 states and 18941 transitions. [2025-02-05 15:38:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:38:46,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-02-05 15:38:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:46,317 INFO L225 Difference]: With dead ends: 10959 [2025-02-05 15:38:46,317 INFO L226 Difference]: Without dead ends: 7320 [2025-02-05 15:38:46,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 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:46,344 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 788 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:46,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1692 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2025-02-05 15:38:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 7315. [2025-02-05 15:38:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7315 states, 5701 states have (on average 1.6798807226802315) internal successors, (9577), 5930 states have internal predecessors, (9577), 1306 states have call successors, (1306), 293 states have call predecessors, (1306), 307 states have return successors, (1763), 1299 states have call predecessors, (1763), 1301 states have call successors, (1763) [2025-02-05 15:38:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 12646 transitions. [2025-02-05 15:38:46,833 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 12646 transitions. Word has length 137 [2025-02-05 15:38:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:46,834 INFO L471 AbstractCegarLoop]: Abstraction has 7315 states and 12646 transitions. [2025-02-05 15:38:46,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 12646 transitions. [2025-02-05 15:38:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:38:46,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:46,840 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:38:46,850 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:47,041 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,SelfDestructingSolverStorable17 [2025-02-05 15:38:47,041 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:47,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:47,042 INFO L85 PathProgramCache]: Analyzing trace with hash 976181494, now seen corresponding path program 1 times [2025-02-05 15:38:47,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:47,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313309992] [2025-02-05 15:38:47,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:47,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:47,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:38:47,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:38:47,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:47,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:38:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313309992] [2025-02-05 15:38:47,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313309992] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809285217] [2025-02-05 15:38:47,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:47,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:47,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:47,183 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:47,186 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:47,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:38:47,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:38:47,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:47,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:47,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1515 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:38:47,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:38:47,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809285217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:47,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:47,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:38:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235617017] [2025-02-05 15:38:47,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:47,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:38:47,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:47,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:38:47,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:47,565 INFO L87 Difference]: Start difference. First operand 7315 states and 12646 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:48,138 INFO L93 Difference]: Finished difference Result 21854 states and 38701 transitions. [2025-02-05 15:38:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:38:48,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-02-05 15:38:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:48,306 INFO L225 Difference]: With dead ends: 21854 [2025-02-05 15:38:48,306 INFO L226 Difference]: Without dead ends: 14576 [2025-02-05 15:38:48,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 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:48,361 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 787 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:48,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1713 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2025-02-05 15:38:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14570. [2025-02-05 15:38:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14570 states, 11357 states have (on average 1.6802852866073787) internal successors, (19083), 11810 states have internal predecessors, (19083), 2602 states have call successors, (2602), 581 states have call predecessors, (2602), 610 states have return successors, (4130), 2594 states have call predecessors, (4130), 2597 states have call successors, (4130) [2025-02-05 15:38:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 25815 transitions. [2025-02-05 15:38:49,193 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 25815 transitions. Word has length 138 [2025-02-05 15:38:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:49,193 INFO L471 AbstractCegarLoop]: Abstraction has 14570 states and 25815 transitions. [2025-02-05 15:38:49,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:38:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 25815 transitions. [2025-02-05 15:38:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 15:38:49,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:49,229 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:38:49,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:49,431 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:49,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 41581650, now seen corresponding path program 1 times [2025-02-05 15:38:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:49,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581673436] [2025-02-05 15:38:49,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:49,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 15:38:49,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 15:38:49,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:49,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-05 15:38:49,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581673436] [2025-02-05 15:38:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581673436] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010430898] [2025-02-05 15:38:49,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:49,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:49,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:49,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:38:49,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:38:49,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 15:38:49,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 15:38:49,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:49,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:49,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:38:49,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 15:38:50,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010430898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:50,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:50,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:38:50,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407219450] [2025-02-05 15:38:50,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:50,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:38:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:50,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:38:50,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:50,114 INFO L87 Difference]: Start difference. First operand 14570 states and 25815 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:38:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:51,389 INFO L93 Difference]: Finished difference Result 29351 states and 53564 transitions. [2025-02-05 15:38:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:38:51,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 199 [2025-02-05 15:38:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:51,513 INFO L225 Difference]: With dead ends: 29351 [2025-02-05 15:38:51,513 INFO L226 Difference]: Without dead ends: 14826 [2025-02-05 15:38:51,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:51,597 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 780 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:51,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 2070 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:38:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14826 states. [2025-02-05 15:38:52,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14826 to 14826. [2025-02-05 15:38:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14826 states, 11581 states have (on average 1.6809429237544253) internal successors, (19467), 12034 states have internal predecessors, (19467), 2602 states have call successors, (2602), 613 states have call predecessors, (2602), 642 states have return successors, (4162), 2594 states have call predecessors, (4162), 2597 states have call successors, (4162) [2025-02-05 15:38:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14826 states to 14826 states and 26231 transitions. [2025-02-05 15:38:52,451 INFO L78 Accepts]: Start accepts. Automaton has 14826 states and 26231 transitions. Word has length 199 [2025-02-05 15:38:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:52,452 INFO L471 AbstractCegarLoop]: Abstraction has 14826 states and 26231 transitions. [2025-02-05 15:38:52,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:38:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 14826 states and 26231 transitions. [2025-02-05 15:38:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 15:38:52,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:52,493 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:38:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:52,698 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:52,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1345919156, now seen corresponding path program 1 times [2025-02-05 15:38:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:52,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900695101] [2025-02-05 15:38:52,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:52,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 15:38:52,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 15:38:52,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:52,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-05 15:38:52,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:52,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900695101] [2025-02-05 15:38:52,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900695101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:52,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202048592] [2025-02-05 15:38:52,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:52,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:52,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:52,901 INFO L229 MonitoredProcess]: Starting monitored process 8 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:52,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:38:53,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 15:38:53,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 15:38:53,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:53,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:53,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 1916 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:38:53,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 15:38:53,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:53,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202048592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:53,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:53,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:38:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896395263] [2025-02-05 15:38:53,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:53,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:38:53,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:53,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:38:53,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:53,441 INFO L87 Difference]: Start difference. First operand 14826 states and 26231 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:38:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:54,719 INFO L93 Difference]: Finished difference Result 29863 states and 54300 transitions. [2025-02-05 15:38:54,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:38:54,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 200 [2025-02-05 15:38:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:54,840 INFO L225 Difference]: With dead ends: 29863 [2025-02-05 15:38:54,840 INFO L226 Difference]: Without dead ends: 15082 [2025-02-05 15:38:54,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:54,919 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 774 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:54,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2067 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:38:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15082 states. [2025-02-05 15:38:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15082 to 15082. [2025-02-05 15:38:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15082 states, 11805 states have (on average 1.6815756035578144) internal successors, (19851), 12258 states have internal predecessors, (19851), 2602 states have call successors, (2602), 645 states have call predecessors, (2602), 674 states have return successors, (4194), 2594 states have call predecessors, (4194), 2597 states have call successors, (4194) [2025-02-05 15:38:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15082 states to 15082 states and 26647 transitions. [2025-02-05 15:38:55,694 INFO L78 Accepts]: Start accepts. Automaton has 15082 states and 26647 transitions. Word has length 200 [2025-02-05 15:38:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:55,694 INFO L471 AbstractCegarLoop]: Abstraction has 15082 states and 26647 transitions. [2025-02-05 15:38:55,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:38:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 15082 states and 26647 transitions. [2025-02-05 15:38:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 15:38:55,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:55,716 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:38:55,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:55,918 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:55,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 943587439, now seen corresponding path program 1 times [2025-02-05 15:38:55,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:55,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854091228] [2025-02-05 15:38:55,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:55,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:55,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 15:38:55,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 15:38:55,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:55,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-05 15:38:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854091228] [2025-02-05 15:38:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854091228] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422141004] [2025-02-05 15:38:56,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:56,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:56,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:56,085 INFO L229 MonitoredProcess]: Starting monitored process 9 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:56,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:38:56,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 15:38:56,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 15:38:56,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:56,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:56,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1917 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:38:56,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 15:38:56,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:56,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422141004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:56,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:56,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:38:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230909280] [2025-02-05 15:38:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:56,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:38:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:56,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:38:56,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:56,560 INFO L87 Difference]: Start difference. First operand 15082 states and 26647 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:38:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:57,561 INFO L93 Difference]: Finished difference Result 30375 states and 55036 transitions. [2025-02-05 15:38:57,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:38:57,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 201 [2025-02-05 15:38:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:57,689 INFO L225 Difference]: With dead ends: 30375 [2025-02-05 15:38:57,690 INFO L226 Difference]: Without dead ends: 15338 [2025-02-05 15:38:57,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:57,775 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 773 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:57,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 2064 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:38:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15338 states. [2025-02-05 15:38:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15338 to 15338. [2025-02-05 15:38:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15338 states, 12029 states have (on average 1.6821847202593732) internal successors, (20235), 12482 states have internal predecessors, (20235), 2602 states have call successors, (2602), 677 states have call predecessors, (2602), 706 states have return successors, (4226), 2594 states have call predecessors, (4226), 2597 states have call successors, (4226) [2025-02-05 15:38:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15338 states to 15338 states and 27063 transitions. [2025-02-05 15:38:58,458 INFO L78 Accepts]: Start accepts. Automaton has 15338 states and 27063 transitions. Word has length 201 [2025-02-05 15:38:58,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:58,460 INFO L471 AbstractCegarLoop]: Abstraction has 15338 states and 27063 transitions. [2025-02-05 15:38:58,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:38:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 15338 states and 27063 transitions. [2025-02-05 15:38:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 15:38:58,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:58,482 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 15:38:58,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:58,683 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:58,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:58,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1256206473, now seen corresponding path program 1 times [2025-02-05 15:38:58,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:58,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848541666] [2025-02-05 15:38:58,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:58,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 15:38:58,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 15:38:58,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:58,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-05 15:38:58,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848541666] [2025-02-05 15:38:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848541666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420061934] [2025-02-05 15:38:58,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:58,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:58,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:58,872 INFO L229 MonitoredProcess]: Starting monitored process 10 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:58,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:38:59,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 15:38:59,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 15:38:59,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:59,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:59,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 1918 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:38:59,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 15:38:59,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:59,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420061934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:59,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:59,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:38:59,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511982465] [2025-02-05 15:38:59,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:59,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:38:59,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:59,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:38:59,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:59,450 INFO L87 Difference]: Start difference. First operand 15338 states and 27063 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:39:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:00,442 INFO L93 Difference]: Finished difference Result 30887 states and 55772 transitions. [2025-02-05 15:39:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:00,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 202 [2025-02-05 15:39:00,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:00,745 INFO L225 Difference]: With dead ends: 30887 [2025-02-05 15:39:00,745 INFO L226 Difference]: Without dead ends: 15594 [2025-02-05 15:39:00,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:39:00,819 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 769 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:00,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 2061 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:39:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15594 states. [2025-02-05 15:39:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15594 to 15594. [2025-02-05 15:39:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15594 states, 12253 states have (on average 1.6827715661470661) internal successors, (20619), 12706 states have internal predecessors, (20619), 2602 states have call successors, (2602), 709 states have call predecessors, (2602), 738 states have return successors, (4258), 2594 states have call predecessors, (4258), 2597 states have call successors, (4258) [2025-02-05 15:39:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 27479 transitions. [2025-02-05 15:39:01,375 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 27479 transitions. Word has length 202 [2025-02-05 15:39:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:01,375 INFO L471 AbstractCegarLoop]: Abstraction has 15594 states and 27479 transitions. [2025-02-05 15:39:01,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:39:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 27479 transitions. [2025-02-05 15:39:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 15:39:01,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:01,394 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:01,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 15:39:01,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:01,595 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:01,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash 414853260, now seen corresponding path program 1 times [2025-02-05 15:39:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287011031] [2025-02-05 15:39:01,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:01,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 15:39:01,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 15:39:01,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:01,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 15:39:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:02,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287011031] [2025-02-05 15:39:02,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287011031] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:02,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751451203] [2025-02-05 15:39:02,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:02,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:02,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:02,027 INFO L229 MonitoredProcess]: Starting monitored process 11 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:39:02,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:39:02,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 15:39:02,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 15:39:02,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:02,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:02,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 1919 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:02,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:39:02,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:02,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751451203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:02,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:02,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:39:02,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469600460] [2025-02-05 15:39:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:02,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:02,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:02,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:02,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:39:02,445 INFO L87 Difference]: Start difference. First operand 15594 states and 27479 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:39:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:02,994 INFO L93 Difference]: Finished difference Result 32583 states and 58748 transitions. [2025-02-05 15:39:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:02,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 203 [2025-02-05 15:39:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:03,159 INFO L225 Difference]: With dead ends: 32583 [2025-02-05 15:39:03,159 INFO L226 Difference]: Without dead ends: 17034 [2025-02-05 15:39:03,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:39:03,252 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 144 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:03,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2266 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17034 states. [2025-02-05 15:39:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17034 to 16842. [2025-02-05 15:39:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16842 states, 13469 states have (on average 1.7042839112035044) internal successors, (22955), 13922 states have internal predecessors, (22955), 2602 states have call successors, (2602), 741 states have call predecessors, (2602), 770 states have return successors, (4258), 2594 states have call predecessors, (4258), 2597 states have call successors, (4258) [2025-02-05 15:39:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16842 states to 16842 states and 29815 transitions. [2025-02-05 15:39:04,056 INFO L78 Accepts]: Start accepts. Automaton has 16842 states and 29815 transitions. Word has length 203 [2025-02-05 15:39:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:04,057 INFO L471 AbstractCegarLoop]: Abstraction has 16842 states and 29815 transitions. [2025-02-05 15:39:04,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:39:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 16842 states and 29815 transitions. [2025-02-05 15:39:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-05 15:39:04,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:04,074 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:04,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 15:39:04,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-05 15:39:04,275 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:04,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1953492145, now seen corresponding path program 1 times [2025-02-05 15:39:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:04,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285084274] [2025-02-05 15:39:04,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:04,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:04,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 15:39:04,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 15:39:04,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:04,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 15:39:04,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285084274] [2025-02-05 15:39:04,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285084274] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:04,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855442437] [2025-02-05 15:39:04,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:04,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:04,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:04,605 INFO L229 MonitoredProcess]: Starting monitored process 12 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:39:04,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:39:04,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 15:39:05,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 15:39:05,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:05,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:05,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 1924 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:05,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:39:05,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:05,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855442437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:05,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:05,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:39:05,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338837040] [2025-02-05 15:39:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:05,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:05,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:05,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:05,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:39:05,152 INFO L87 Difference]: Start difference. First operand 16842 states and 29815 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:39:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:05,898 INFO L93 Difference]: Finished difference Result 35079 states and 63516 transitions. [2025-02-05 15:39:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:05,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 208 [2025-02-05 15:39:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:06,085 INFO L225 Difference]: With dead ends: 35079 [2025-02-05 15:39:06,085 INFO L226 Difference]: Without dead ends: 18282 [2025-02-05 15:39:06,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:39:06,206 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 140 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:06,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2269 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:39:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18282 states. [2025-02-05 15:39:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18282 to 18090. [2025-02-05 15:39:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18090 states, 14653 states have (on average 1.7238108237221046) internal successors, (25259), 15106 states have internal predecessors, (25259), 2634 states have call successors, (2634), 773 states have call predecessors, (2634), 802 states have return successors, (4290), 2626 states have call predecessors, (4290), 2629 states have call successors, (4290) [2025-02-05 15:39:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18090 states to 18090 states and 32183 transitions. [2025-02-05 15:39:06,981 INFO L78 Accepts]: Start accepts. Automaton has 18090 states and 32183 transitions. Word has length 208 [2025-02-05 15:39:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:06,983 INFO L471 AbstractCegarLoop]: Abstraction has 18090 states and 32183 transitions. [2025-02-05 15:39:06,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:39:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 18090 states and 32183 transitions. [2025-02-05 15:39:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 15:39:07,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:07,004 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:07,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 15:39:07,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-05 15:39:07,205 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:07,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:07,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1501475665, now seen corresponding path program 1 times [2025-02-05 15:39:07,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:07,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519666527] [2025-02-05 15:39:07,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:07,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:07,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 15:39:07,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 15:39:07,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:07,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 15:39:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519666527] [2025-02-05 15:39:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519666527] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535517590] [2025-02-05 15:39:07,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:07,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:07,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:07,707 INFO L229 MonitoredProcess]: Starting monitored process 13 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:39:07,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:39:07,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 15:39:08,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 15:39:08,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:08,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:08,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1925 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:08,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:39:08,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:08,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535517590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:08,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:08,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:39:08,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36658217] [2025-02-05 15:39:08,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:08,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:08,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:08,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:08,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:39:08,134 INFO L87 Difference]: Start difference. First operand 18090 states and 32183 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:39:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:08,739 INFO L93 Difference]: Finished difference Result 37671 states and 68188 transitions. [2025-02-05 15:39:08,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:08,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 209 [2025-02-05 15:39:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:08,851 INFO L225 Difference]: With dead ends: 37671 [2025-02-05 15:39:08,851 INFO L226 Difference]: Without dead ends: 19626 [2025-02-05 15:39:08,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:39:08,912 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 142 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:08,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2263 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19626 states. [2025-02-05 15:39:09,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19626 to 19338. [2025-02-05 15:39:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19338 states, 15869 states have (on average 1.738924948011847) internal successors, (27595), 16322 states have internal predecessors, (27595), 2634 states have call successors, (2634), 805 states have call predecessors, (2634), 834 states have return successors, (4290), 2626 states have call predecessors, (4290), 2629 states have call successors, (4290) [2025-02-05 15:39:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19338 states to 19338 states and 34519 transitions. [2025-02-05 15:39:09,610 INFO L78 Accepts]: Start accepts. Automaton has 19338 states and 34519 transitions. Word has length 209 [2025-02-05 15:39:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:09,611 INFO L471 AbstractCegarLoop]: Abstraction has 19338 states and 34519 transitions. [2025-02-05 15:39:09,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:39:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 19338 states and 34519 transitions. [2025-02-05 15:39:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 15:39:09,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:09,633 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:09,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 15:39:09,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:09,833 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:09,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:09,834 INFO L85 PathProgramCache]: Analyzing trace with hash -597937137, now seen corresponding path program 1 times [2025-02-05 15:39:09,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599782399] [2025-02-05 15:39:09,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:09,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 15:39:09,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 15:39:09,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:09,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:39:10,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:10,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599782399] [2025-02-05 15:39:10,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599782399] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:10,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968392070] [2025-02-05 15:39:10,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:10,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:10,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:10,461 INFO L229 MonitoredProcess]: Starting monitored process 14 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:39:10,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:39:10,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 15:39:10,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 15:39:10,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:10,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:10,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 1929 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:10,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:39:10,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968392070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:10,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:10,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:39:10,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033357885] [2025-02-05 15:39:10,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:10,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:10,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:10,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:10,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:39:10,902 INFO L87 Difference]: Start difference. First operand 19338 states and 34519 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:39:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:11,718 INFO L93 Difference]: Finished difference Result 40167 states and 72988 transitions. [2025-02-05 15:39:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:11,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 213 [2025-02-05 15:39:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:11,941 INFO L225 Difference]: With dead ends: 40167 [2025-02-05 15:39:11,941 INFO L226 Difference]: Without dead ends: 20874 [2025-02-05 15:39:12,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:39:12,062 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 138 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:12,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 2255 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:39:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20874 states. [2025-02-05 15:39:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20874 to 20586. [2025-02-05 15:39:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20586 states, 17053 states have (on average 1.7532985398463614) internal successors, (29899), 17506 states have internal predecessors, (29899), 2666 states have call successors, (2666), 837 states have call predecessors, (2666), 866 states have return successors, (4322), 2658 states have call predecessors, (4322), 2661 states have call successors, (4322) [2025-02-05 15:39:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20586 states to 20586 states and 36887 transitions. [2025-02-05 15:39:12,982 INFO L78 Accepts]: Start accepts. Automaton has 20586 states and 36887 transitions. Word has length 213 [2025-02-05 15:39:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:12,982 INFO L471 AbstractCegarLoop]: Abstraction has 20586 states and 36887 transitions. [2025-02-05 15:39:12,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:39:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 20586 states and 36887 transitions. [2025-02-05 15:39:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 15:39:13,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:13,006 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:13,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-05 15:39:13,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:13,207 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:13,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:13,207 INFO L85 PathProgramCache]: Analyzing trace with hash 832675716, now seen corresponding path program 1 times [2025-02-05 15:39:13,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:13,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444223246] [2025-02-05 15:39:13,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:13,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:13,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 15:39:13,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 15:39:13,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:13,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:39:13,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:13,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444223246] [2025-02-05 15:39:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444223246] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111129596] [2025-02-05 15:39:13,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:13,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:13,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:13,636 INFO L229 MonitoredProcess]: Starting monitored process 15 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:39:13,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 15:39:13,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 15:39:14,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 15:39:14,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:14,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:14,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:14,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:39:14,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:14,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111129596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:14,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:14,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:39:14,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855172471] [2025-02-05 15:39:14,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:14,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:14,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:14,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:14,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:39:14,105 INFO L87 Difference]: Start difference. First operand 20586 states and 36887 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:39:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:14,934 INFO L93 Difference]: Finished difference Result 42759 states and 77628 transitions. [2025-02-05 15:39:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:14,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 214 [2025-02-05 15:39:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:15,304 INFO L225 Difference]: With dead ends: 42759 [2025-02-05 15:39:15,304 INFO L226 Difference]: Without dead ends: 22218 [2025-02-05 15:39:15,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:39:15,377 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 140 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:15,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2260 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22218 states. [2025-02-05 15:39:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22218 to 21834. [2025-02-05 15:39:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21834 states, 18269 states have (on average 1.7644643932344408) internal successors, (32235), 18722 states have internal predecessors, (32235), 2666 states have call successors, (2666), 869 states have call predecessors, (2666), 898 states have return successors, (4322), 2658 states have call predecessors, (4322), 2661 states have call successors, (4322) [2025-02-05 15:39:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21834 states to 21834 states and 39223 transitions. [2025-02-05 15:39:16,020 INFO L78 Accepts]: Start accepts. Automaton has 21834 states and 39223 transitions. Word has length 214 [2025-02-05 15:39:16,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:16,021 INFO L471 AbstractCegarLoop]: Abstraction has 21834 states and 39223 transitions. [2025-02-05 15:39:16,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:39:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 21834 states and 39223 transitions. [2025-02-05 15:39:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-02-05 15:39:16,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:16,040 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:16,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-05 15:39:16,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 15:39:16,240 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:16,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash 646139967, now seen corresponding path program 1 times [2025-02-05 15:39:16,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:16,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396645916] [2025-02-05 15:39:16,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:16,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-05 15:39:16,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-05 15:39:16,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:16,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-02-05 15:39:16,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396645916] [2025-02-05 15:39:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396645916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312047593] [2025-02-05 15:39:16,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:16,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:16,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:16,661 INFO L229 MonitoredProcess]: Starting monitored process 16 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:39:16,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 15:39:16,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-05 15:39:17,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-05 15:39:17,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:17,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:17,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 2452 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:39:17,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-02-05 15:39:17,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:39:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-02-05 15:39:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312047593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:39:17,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:39:17,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 16 [2025-02-05 15:39:17,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835765580] [2025-02-05 15:39:17,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:39:17,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 15:39:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:17,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 15:39:17,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:39:17,785 INFO L87 Difference]: Start difference. First operand 21834 states and 39223 transitions. Second operand has 16 states, 16 states have (on average 16.9375) internal successors, (271), 14 states have internal predecessors, (271), 9 states have call successors, (59), 6 states have call predecessors, (59), 9 states have return successors, (58), 12 states have call predecessors, (58), 8 states have call successors, (58)