./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product28.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_product28.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 339ae17141354782861ad14ce1f1515b53735bca35311ebbaf6a68a6022f4172 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:38:54,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:38:54,626 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:54,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:38:54,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:38:54,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:38:54,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:38:54,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:38:54,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:38:54,643 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:38:54,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:38:54,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:38:54,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:38:54,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:38:54,644 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:38:54,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:38:54,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:38:54,644 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:38:54,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:38:54,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:38:54,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:38:54,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:38:54,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:38:54,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:38:54,645 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:38:54,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:38:54,645 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:38:54,645 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:38:54,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:38:54,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:38:54,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:38:54,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:38:54,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:38:54,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:38:54,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:38:54,646 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:38:54,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:38:54,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:38:54,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:38:54,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:38:54,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:38:54,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:38:54,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:38:54,646 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 -> 339ae17141354782861ad14ce1f1515b53735bca35311ebbaf6a68a6022f4172 [2025-02-05 15:38:54,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:38:54,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:38:54,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:38:54,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:38:54,823 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:38:54,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2025-02-05 15:38:55,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c580f1cd6/2ecd45cf0d0545339f1b42c3bccbbaa0/FLAG9966ab0f2 [2025-02-05 15:38:56,316 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:38:56,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2025-02-05 15:38:56,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c580f1cd6/2ecd45cf0d0545339f1b42c3bccbbaa0/FLAG9966ab0f2 [2025-02-05 15:38:56,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c580f1cd6/2ecd45cf0d0545339f1b42c3bccbbaa0 [2025-02-05 15:38:56,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:38:56,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:38:56,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:38:56,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:38:56,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:38:56,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:38:56" (1/1) ... [2025-02-05 15:38:56,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf56c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:56, skipping insertion in model container [2025-02-05 15:38:56,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:38:56" (1/1) ... [2025-02-05 15:38:56,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:38:56,970 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_product28.cil.c[73050,73063] [2025-02-05 15:38:56,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:38:56,986 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:38:56,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-02-05 15:38:56,993 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [716] [2025-02-05 15:38:56,993 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [837] [2025-02-05 15:38:56,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [875] [2025-02-05 15:38:56,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2483] [2025-02-05 15:38:56,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [2849] [2025-02-05 15:38:56,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3009] [2025-02-05 15:38:56,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3361] [2025-02-05 15:38:56,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3373] [2025-02-05 15:38:56,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3464] [2025-02-05 15:38:57,050 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_product28.cil.c[73050,73063] [2025-02-05 15:38:57,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:38:57,069 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:38:57,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:57 WrapperNode [2025-02-05 15:38:57,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:38:57,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:38:57,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:38:57,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:38:57,075 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:57" (1/1) ... [2025-02-05 15:38:57,091 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:57" (1/1) ... [2025-02-05 15:38:57,117 INFO L138 Inliner]: procedures = 97, calls = 345, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 1127 [2025-02-05 15:38:57,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:38:57,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:38:57,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:38:57,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:38:57,126 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:57" (1/1) ... [2025-02-05 15:38:57,127 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:57" (1/1) ... [2025-02-05 15:38:57,131 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:57" (1/1) ... [2025-02-05 15:38:57,146 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:38:57,149 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:57" (1/1) ... [2025-02-05 15:38:57,150 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:57" (1/1) ... [2025-02-05 15:38:57,161 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:57" (1/1) ... [2025-02-05 15:38:57,163 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:57" (1/1) ... [2025-02-05 15:38:57,165 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:57" (1/1) ... [2025-02-05 15:38:57,167 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:57" (1/1) ... [2025-02-05 15:38:57,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:38:57,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:38:57,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:38:57,171 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:38:57,172 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:57" (1/1) ... [2025-02-05 15:38:57,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:38:57,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:57,201 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:57,203 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:57,227 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:38:57,228 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:38:57,228 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:38:57,228 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:38:57,228 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:38:57,228 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:38:57,228 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:38:57,228 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:38:57,228 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:38:57,228 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:38:57,228 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:38:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:38:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:38:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:38:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:38:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-02-05 15:38:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:38:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:38:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-02-05 15:38:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:38:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:38:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:38:57,230 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:38:57,230 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-02-05 15:38:57,230 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:38:57,230 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:38:57,230 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:38:57,230 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:38:57,230 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-02-05 15:38:57,230 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:38:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:38:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:38:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:38:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:38:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:38:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:38:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:38:57,231 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:38:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:38:57,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:38:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:38:57,231 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:38:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-02-05 15:38:57,231 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-02-05 15:38:57,349 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:38:57,351 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:38:57,386 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L834: #res := ~retValue_acc~5; [2025-02-05 15:38:57,400 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L756: #res := ~retValue_acc~3; [2025-02-05 15:38:57,402 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L961: #res := ~retValue_acc~8; [2025-02-05 15:38:57,409 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1139: #res := ~retValue_acc~9; [2025-02-05 15:38:57,461 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~11#1; [2025-02-05 15:38:57,462 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1795: #res#1 := ~retValue_acc~19#1; [2025-02-05 15:38:57,468 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2471: #res := ~retValue_acc~23; [2025-02-05 15:38:57,725 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: #res#1 := ~retValue_acc~17#1; [2025-02-05 15:38:57,725 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1676-1: stopRequestedInDirection__wrappee__empty_#res#1 := stopRequestedInDirection__wrappee__empty_~retValue_acc~16#1; [2025-02-05 15:38:57,795 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1840: #res := ~retValue_acc~21; [2025-02-05 15:38:57,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L795: #res := ~retValue_acc~4; [2025-02-05 15:38:57,823 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1231: #res := ~retValue_acc~13; [2025-02-05 15:38:57,941 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1311-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; [2025-02-05 15:38:57,941 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1324-1: isIdle_#res#1 := isIdle_~retValue_acc~15#1; [2025-02-05 15:38:57,987 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: #res := ~retValue_acc~1; [2025-02-05 15:38:58,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L872-1: valid_product_#res#1 := valid_product_~retValue_acc~7#1; [2025-02-05 15:38:58,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3358-1: main_#res#1 := main_~retValue_acc~29#1; [2025-02-05 15:38:58,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~0; [2025-02-05 15:38:58,045 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1148: #res := ~retValue_acc~10; [2025-02-05 15:38:58,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~2; [2025-02-05 15:38:58,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-02-05 15:38:58,214 INFO L? ?]: Removed 456 outVars from TransFormulas that were not future-live. [2025-02-05 15:38:58,215 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:38:58,229 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:38:58,229 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:38:58,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:38:58 BoogieIcfgContainer [2025-02-05 15:38:58,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:38:58,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:38:58,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:38:58,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:38:58,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:38:56" (1/3) ... [2025-02-05 15:38:58,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636d6d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:38:58, skipping insertion in model container [2025-02-05 15:38:58,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:57" (2/3) ... [2025-02-05 15:38:58,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636d6d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:38:58, skipping insertion in model container [2025-02-05 15:38:58,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:38:58" (3/3) ... [2025-02-05 15:38:58,235 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product28.cil.c [2025-02-05 15:38:58,251 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:38:58,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product28.cil.c that has 27 procedures, 573 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:38:58,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:38:58,349 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;@1c30d946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:38:58,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:38:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 573 states, 447 states have (on average 1.686800894854586) internal successors, (754), 471 states have internal predecessors, (754), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:38:58,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 15:38:58,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:58,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:58,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:58,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash -530861002, now seen corresponding path program 1 times [2025-02-05 15:38:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17477901] [2025-02-05 15:38:58,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:58,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 15:38:58,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 15:38:58,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:58,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:58,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:58,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17477901] [2025-02-05 15:38:58,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17477901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:58,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:58,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749060167] [2025-02-05 15:38:58,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:58,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:58,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:58,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:58,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:58,860 INFO L87 Difference]: Start difference. First operand has 573 states, 447 states have (on average 1.686800894854586) internal successors, (754), 471 states have internal predecessors, (754), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:58,965 INFO L93 Difference]: Finished difference Result 1126 states and 1870 transitions. [2025-02-05 15:38:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:58,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2025-02-05 15:38:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:58,977 INFO L225 Difference]: With dead ends: 1126 [2025-02-05 15:38:58,977 INFO L226 Difference]: Without dead ends: 564 [2025-02-05 15:38:58,982 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:58,984 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 5 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2780 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:58,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2780 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:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-05 15:38:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-02-05 15:38:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6802721088435375) internal successors, (741), 462 states have internal predecessors, (741), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:38:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 930 transitions. [2025-02-05 15:38:59,033 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 930 transitions. Word has length 80 [2025-02-05 15:38:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:59,033 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 930 transitions. [2025-02-05 15:38:59,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 930 transitions. [2025-02-05 15:38:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 15:38:59,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:59,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:59,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:38:59,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:59,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash -589393000, now seen corresponding path program 1 times [2025-02-05 15:38:59,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:59,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624996443] [2025-02-05 15:38:59,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:59,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:59,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 15:38:59,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 15:38:59,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:59,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:59,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:59,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624996443] [2025-02-05 15:38:59,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624996443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:59,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:59,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113155365] [2025-02-05 15:38:59,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:59,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:59,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:59,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:59,251 INFO L87 Difference]: Start difference. First operand 564 states and 930 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:59,308 INFO L93 Difference]: Finished difference Result 1110 states and 1837 transitions. [2025-02-05 15:38:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:59,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 81 [2025-02-05 15:38:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:59,312 INFO L225 Difference]: With dead ends: 1110 [2025-02-05 15:38:59,313 INFO L226 Difference]: Without dead ends: 564 [2025-02-05 15:38:59,314 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:59,315 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 4 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2753 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:59,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2753 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:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-05 15:38:59,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-02-05 15:38:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6780045351473922) internal successors, (740), 462 states have internal predecessors, (740), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:38:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 929 transitions. [2025-02-05 15:38:59,343 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 929 transitions. Word has length 81 [2025-02-05 15:38:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:59,343 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 929 transitions. [2025-02-05 15:38:59,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 929 transitions. [2025-02-05 15:38:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 15:38:59,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:59,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:59,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:38:59,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:59,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:59,349 INFO L85 PathProgramCache]: Analyzing trace with hash 713194963, now seen corresponding path program 1 times [2025-02-05 15:38:59,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:59,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189414972] [2025-02-05 15:38:59,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:59,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:59,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 15:38:59,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 15:38:59,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:59,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:59,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:59,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189414972] [2025-02-05 15:38:59,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189414972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:59,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:59,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:59,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908008081] [2025-02-05 15:38:59,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:59,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:59,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:59,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:59,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:59,497 INFO L87 Difference]: Start difference. First operand 564 states and 929 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:59,542 INFO L93 Difference]: Finished difference Result 1110 states and 1836 transitions. [2025-02-05 15:38:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:59,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2025-02-05 15:38:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:59,546 INFO L225 Difference]: With dead ends: 1110 [2025-02-05 15:38:59,547 INFO L226 Difference]: Without dead ends: 564 [2025-02-05 15:38:59,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:59,550 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 3 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2753 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:59,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2753 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:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-05 15:38:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-02-05 15:38:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6757369614512472) internal successors, (739), 462 states have internal predecessors, (739), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:38:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 928 transitions. [2025-02-05 15:38:59,587 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 928 transitions. Word has length 82 [2025-02-05 15:38:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:59,587 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 928 transitions. [2025-02-05 15:38:59,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 928 transitions. [2025-02-05 15:38:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 15:38:59,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:59,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:59,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:38:59,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:59,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1260828757, now seen corresponding path program 1 times [2025-02-05 15:38:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424197095] [2025-02-05 15:38:59,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:59,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 15:38:59,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:38:59,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:59,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:59,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:59,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424197095] [2025-02-05 15:38:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424197095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:59,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:59,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:59,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330652261] [2025-02-05 15:38:59,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:59,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:59,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:59,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:59,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:59,721 INFO L87 Difference]: Start difference. First operand 564 states and 928 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:59,781 INFO L93 Difference]: Finished difference Result 1110 states and 1835 transitions. [2025-02-05 15:38:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:59,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2025-02-05 15:38:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:59,786 INFO L225 Difference]: With dead ends: 1110 [2025-02-05 15:38:59,787 INFO L226 Difference]: Without dead ends: 564 [2025-02-05 15:38:59,789 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:59,789 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 2 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2753 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:59,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2753 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:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-05 15:38:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-02-05 15:38:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6734693877551021) internal successors, (738), 462 states have internal predecessors, (738), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:38:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 927 transitions. [2025-02-05 15:38:59,815 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 927 transitions. Word has length 83 [2025-02-05 15:38:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:59,815 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 927 transitions. [2025-02-05 15:38:59,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 927 transitions. [2025-02-05 15:38:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 15:38:59,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:59,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:59,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:38:59,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:59,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash -120280208, now seen corresponding path program 1 times [2025-02-05 15:38:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:59,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681216201] [2025-02-05 15:38:59,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:59,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 15:38:59,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 15:38:59,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:59,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:59,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:59,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681216201] [2025-02-05 15:38:59,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681216201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:59,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:59,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:59,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206651930] [2025-02-05 15:38:59,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:59,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:59,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:59,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:59,935 INFO L87 Difference]: Start difference. First operand 564 states and 927 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:59,975 INFO L93 Difference]: Finished difference Result 1110 states and 1834 transitions. [2025-02-05 15:38:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:59,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2025-02-05 15:38:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:59,981 INFO L225 Difference]: With dead ends: 1110 [2025-02-05 15:38:59,982 INFO L226 Difference]: Without dead ends: 564 [2025-02-05 15:38:59,984 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:59,985 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 1 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2753 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:59,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2753 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:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-05 15:39:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-02-05 15:39:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6712018140589568) internal successors, (737), 462 states have internal predecessors, (737), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:39:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 926 transitions. [2025-02-05 15:39:00,008 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 926 transitions. Word has length 84 [2025-02-05 15:39:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:00,008 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 926 transitions. [2025-02-05 15:39:00,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 926 transitions. [2025-02-05 15:39:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 15:39:00,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:00,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:00,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:39:00,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:00,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:00,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1162872558, now seen corresponding path program 1 times [2025-02-05 15:39:00,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:00,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421428771] [2025-02-05 15:39:00,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:00,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 15:39:00,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 15:39:00,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:00,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:00,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421428771] [2025-02-05 15:39:00,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421428771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:00,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:00,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:39:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393533999] [2025-02-05 15:39:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:00,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:39:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:00,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:39:00,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:00,158 INFO L87 Difference]: Start difference. First operand 564 states and 926 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:39:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:00,235 INFO L93 Difference]: Finished difference Result 1076 states and 1766 transitions. [2025-02-05 15:39:00,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:39:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 85 [2025-02-05 15:39:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:00,239 INFO L225 Difference]: With dead ends: 1076 [2025-02-05 15:39:00,239 INFO L226 Difference]: Without dead ends: 579 [2025-02-05 15:39:00,240 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:39:00,241 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 91 mSDsluCounter, 4499 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5415 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:00,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5415 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-02-05 15:39:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 577. [2025-02-05 15:39:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 451 states have (on average 1.6674057649667406) internal successors, (752), 474 states have internal predecessors, (752), 98 states have call successors, (98), 26 states have call predecessors, (98), 27 states have return successors, (95), 90 states have call predecessors, (95), 93 states have call successors, (95) [2025-02-05 15:39:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 945 transitions. [2025-02-05 15:39:00,265 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 945 transitions. Word has length 85 [2025-02-05 15:39:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:00,265 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 945 transitions. [2025-02-05 15:39:00,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:39:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 945 transitions. [2025-02-05 15:39:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 15:39:00,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:00,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:00,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:39:00,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:00,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1461581169, now seen corresponding path program 1 times [2025-02-05 15:39:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:00,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167201146] [2025-02-05 15:39:00,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:00,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 15:39:00,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 15:39:00,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:00,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:00,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167201146] [2025-02-05 15:39:00,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167201146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:00,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:00,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:39:00,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304018669] [2025-02-05 15:39:00,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:00,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:00,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:00,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:39:00,352 INFO L87 Difference]: Start difference. First operand 577 states and 945 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:00,388 INFO L93 Difference]: Finished difference Result 1128 states and 1860 transitions. [2025-02-05 15:39:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:39:00,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2025-02-05 15:39:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:00,391 INFO L225 Difference]: With dead ends: 1128 [2025-02-05 15:39:00,391 INFO L226 Difference]: Without dead ends: 558 [2025-02-05 15:39:00,393 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:39:00,393 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 0 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2755 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:39:00,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2755 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-02-05 15:39:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2025-02-05 15:39:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 435 states have (on average 1.6620689655172414) internal successors, (723), 456 states have internal predecessors, (723), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:39:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 912 transitions. [2025-02-05 15:39:00,411 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 912 transitions. Word has length 85 [2025-02-05 15:39:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:00,412 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 912 transitions. [2025-02-05 15:39:00,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 912 transitions. [2025-02-05 15:39:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 15:39:00,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:00,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:00,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:39:00,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:00,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 928823436, now seen corresponding path program 1 times [2025-02-05 15:39:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:00,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833414020] [2025-02-05 15:39:00,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:00,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:00,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 15:39:00,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 15:39:00,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:00,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:00,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:00,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833414020] [2025-02-05 15:39:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833414020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:00,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:00,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:00,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716569676] [2025-02-05 15:39:00,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:00,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:00,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:00,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:00,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:00,543 INFO L87 Difference]: Start difference. First operand 558 states and 912 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:00,692 INFO L93 Difference]: Finished difference Result 1073 states and 1758 transitions. [2025-02-05 15:39:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:00,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-02-05 15:39:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:00,696 INFO L225 Difference]: With dead ends: 1073 [2025-02-05 15:39:00,696 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:39:00,697 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:39:00,698 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 55 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4316 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:00,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4316 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:39:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 558. [2025-02-05 15:39:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 435 states have (on average 1.6528735632183909) internal successors, (719), 456 states have internal predecessors, (719), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:39:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 908 transitions. [2025-02-05 15:39:00,716 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 908 transitions. Word has length 86 [2025-02-05 15:39:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:00,716 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 908 transitions. [2025-02-05 15:39:00,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 908 transitions. [2025-02-05 15:39:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:39:00,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:00,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:00,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:39:00,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:00,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1036257641, now seen corresponding path program 1 times [2025-02-05 15:39:00,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:00,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224628218] [2025-02-05 15:39:00,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:00,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:00,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:39:00,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:39:00,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:00,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:00,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:00,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224628218] [2025-02-05 15:39:00,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224628218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:00,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:00,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:00,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63018339] [2025-02-05 15:39:00,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:00,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:00,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:00,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:00,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:00,843 INFO L87 Difference]: Start difference. First operand 558 states and 908 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:00,971 INFO L93 Difference]: Finished difference Result 1073 states and 1754 transitions. [2025-02-05 15:39:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2025-02-05 15:39:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:00,976 INFO L225 Difference]: With dead ends: 1073 [2025-02-05 15:39:00,976 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:39:00,977 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:39:00,978 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 54 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4316 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:39:00,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4316 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:39:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 558. [2025-02-05 15:39:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 435 states have (on average 1.6436781609195403) internal successors, (715), 456 states have internal predecessors, (715), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:39:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 904 transitions. [2025-02-05 15:39:01,014 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 904 transitions. Word has length 87 [2025-02-05 15:39:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:01,014 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 904 transitions. [2025-02-05 15:39:01,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 904 transitions. [2025-02-05 15:39:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 15:39:01,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:01,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:01,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:39:01,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:01,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1774217873, now seen corresponding path program 1 times [2025-02-05 15:39:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:01,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716960614] [2025-02-05 15:39:01,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:01,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:01,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 15:39:01,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 15:39:01,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:01,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:01,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:01,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716960614] [2025-02-05 15:39:01,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716960614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:01,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:01,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:01,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728609150] [2025-02-05 15:39:01,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:01,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:01,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:01,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:01,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:01,115 INFO L87 Difference]: Start difference. First operand 558 states and 904 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:01,234 INFO L93 Difference]: Finished difference Result 1073 states and 1750 transitions. [2025-02-05 15:39:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:01,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-02-05 15:39:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:01,238 INFO L225 Difference]: With dead ends: 1073 [2025-02-05 15:39:01,238 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:39:01,239 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:39:01,240 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 53 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4298 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:39:01,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4298 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:39:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 558. [2025-02-05 15:39:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 435 states have (on average 1.6344827586206896) internal successors, (711), 456 states have internal predecessors, (711), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:39:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 900 transitions. [2025-02-05 15:39:01,255 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 900 transitions. Word has length 88 [2025-02-05 15:39:01,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:01,255 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 900 transitions. [2025-02-05 15:39:01,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 900 transitions. [2025-02-05 15:39:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 15:39:01,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:01,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:01,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:39:01,257 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:01,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:01,257 INFO L85 PathProgramCache]: Analyzing trace with hash 63218718, now seen corresponding path program 1 times [2025-02-05 15:39:01,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:01,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827524847] [2025-02-05 15:39:01,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:01,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:01,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 15:39:01,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 15:39:01,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:01,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:01,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:01,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827524847] [2025-02-05 15:39:01,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827524847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:01,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:01,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:39:01,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860353475] [2025-02-05 15:39:01,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:01,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:39:01,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:01,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:39:01,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:01,390 INFO L87 Difference]: Start difference. First operand 558 states and 900 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:39:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:01,451 INFO L93 Difference]: Finished difference Result 1064 states and 1732 transitions. [2025-02-05 15:39:01,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:39:01,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2025-02-05 15:39:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:01,455 INFO L225 Difference]: With dead ends: 1064 [2025-02-05 15:39:01,455 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 15:39:01,458 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:39:01,458 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 84 mSDsluCounter, 4372 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5261 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:39:01,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5261 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 15:39:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-02-05 15:39:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 414 states have (on average 1.6352657004830917) internal successors, (677), 435 states have internal predecessors, (677), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:39:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 866 transitions. [2025-02-05 15:39:01,476 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 866 transitions. Word has length 88 [2025-02-05 15:39:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:01,476 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 866 transitions. [2025-02-05 15:39:01,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:39:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 866 transitions. [2025-02-05 15:39:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 15:39:01,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:01,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:01,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:39:01,478 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:01,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash -550614164, now seen corresponding path program 1 times [2025-02-05 15:39:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140984474] [2025-02-05 15:39:01,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:01,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:01,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 15:39:01,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:39:01,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:01,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:01,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140984474] [2025-02-05 15:39:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140984474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:01,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:01,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:01,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062305179] [2025-02-05 15:39:01,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:01,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:01,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:01,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:01,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:01,601 INFO L87 Difference]: Start difference. First operand 537 states and 866 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:01,658 INFO L93 Difference]: Finished difference Result 1043 states and 1698 transitions. [2025-02-05 15:39:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2025-02-05 15:39:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:01,663 INFO L225 Difference]: With dead ends: 1043 [2025-02-05 15:39:01,663 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 15:39:01,665 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:39:01,665 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 17 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4236 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:39:01,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4236 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 15:39:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-02-05 15:39:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 414 states have (on average 1.6328502415458936) internal successors, (676), 435 states have internal predecessors, (676), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:39:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 865 transitions. [2025-02-05 15:39:01,679 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 865 transitions. Word has length 89 [2025-02-05 15:39:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:01,680 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 865 transitions. [2025-02-05 15:39:01,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 865 transitions. [2025-02-05 15:39:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 15:39:01,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:01,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:01,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:39:01,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:01,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:01,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1175393874, now seen corresponding path program 1 times [2025-02-05 15:39:01,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:01,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422165750] [2025-02-05 15:39:01,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:01,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:01,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 15:39:01,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 15:39:01,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:01,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422165750] [2025-02-05 15:39:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422165750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607047822] [2025-02-05 15:39:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:01,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:01,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:01,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:01,782 INFO L87 Difference]: Start difference. First operand 537 states and 865 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:01,849 INFO L93 Difference]: Finished difference Result 1043 states and 1697 transitions. [2025-02-05 15:39:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:01,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2025-02-05 15:39:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:01,853 INFO L225 Difference]: With dead ends: 1043 [2025-02-05 15:39:01,854 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 15:39:01,855 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:39:01,856 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 16 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4236 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:39:01,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4236 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 15:39:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-02-05 15:39:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 414 states have (on average 1.6304347826086956) internal successors, (675), 435 states have internal predecessors, (675), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:39:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 864 transitions. [2025-02-05 15:39:01,870 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 864 transitions. Word has length 90 [2025-02-05 15:39:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:01,870 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 864 transitions. [2025-02-05 15:39:01,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 864 transitions. [2025-02-05 15:39:01,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 15:39:01,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:01,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:01,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:39:01,872 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:01,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:01,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1296066927, now seen corresponding path program 1 times [2025-02-05 15:39:01,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:01,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682648545] [2025-02-05 15:39:01,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:01,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:01,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 15:39:01,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 15:39:01,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:01,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:01,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:01,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682648545] [2025-02-05 15:39:01,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682648545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:01,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:01,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:39:01,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502972657] [2025-02-05 15:39:01,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:01,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:01,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:01,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:01,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:39:01,945 INFO L87 Difference]: Start difference. First operand 537 states and 864 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:01,977 INFO L93 Difference]: Finished difference Result 1037 states and 1685 transitions. [2025-02-05 15:39:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:39:01,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2025-02-05 15:39:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:01,981 INFO L225 Difference]: With dead ends: 1037 [2025-02-05 15:39:01,982 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 15:39:01,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:39:01,984 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 5 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:01,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2546 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 15:39:01,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-02-05 15:39:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 414 states have (on average 1.6280193236714975) internal successors, (674), 435 states have internal predecessors, (674), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:39:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 863 transitions. [2025-02-05 15:39:01,997 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 863 transitions. Word has length 91 [2025-02-05 15:39:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:01,997 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 863 transitions. [2025-02-05 15:39:01,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 863 transitions. [2025-02-05 15:39:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 15:39:01,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:01,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:01,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:39:01,999 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:02,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1575674725, now seen corresponding path program 1 times [2025-02-05 15:39:02,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:02,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646253530] [2025-02-05 15:39:02,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:02,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:02,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 15:39:02,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 15:39:02,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:02,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:02,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646253530] [2025-02-05 15:39:02,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646253530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:02,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:02,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868613763] [2025-02-05 15:39:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:02,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:02,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:02,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:02,160 INFO L87 Difference]: Start difference. First operand 537 states and 863 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 6 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:39:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:04,019 INFO L93 Difference]: Finished difference Result 1656 states and 2724 transitions. [2025-02-05 15:39:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:04,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 6 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 92 [2025-02-05 15:39:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:04,027 INFO L225 Difference]: With dead ends: 1656 [2025-02-05 15:39:04,028 INFO L226 Difference]: Without dead ends: 1164 [2025-02-05 15:39:04,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:39:04,030 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 1972 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2037 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:04,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2037 Valid, 1097 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 15:39:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-02-05 15:39:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1032. [2025-02-05 15:39:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 803 states have (on average 1.6488169364881693) internal successors, (1324), 833 states have internal predecessors, (1324), 181 states have call successors, (181), 46 states have call predecessors, (181), 47 states have return successors, (183), 165 states have call predecessors, (183), 176 states have call successors, (183) [2025-02-05 15:39:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1688 transitions. [2025-02-05 15:39:04,071 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1688 transitions. Word has length 92 [2025-02-05 15:39:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:04,072 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1688 transitions. [2025-02-05 15:39:04,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 6 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:39:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1688 transitions. [2025-02-05 15:39:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:39:04,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:04,076 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:04,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:39:04,076 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:04,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash 216703266, now seen corresponding path program 1 times [2025-02-05 15:39:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047922897] [2025-02-05 15:39:04,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:04,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:04,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:39:04,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:39:04,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:04,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:04,217 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:39:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:04,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047922897] [2025-02-05 15:39:04,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047922897] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:04,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898386882] [2025-02-05 15:39:04,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:04,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:04,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:04,224 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:39:04,226 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:39:04,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:39:04,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:39:04,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:04,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:04,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 1775 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:04,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:04,537 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:39:04,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898386882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:04,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:04,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:39:04,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975268166] [2025-02-05 15:39:04,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:04,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:04,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:04,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:04,539 INFO L87 Difference]: Start difference. First operand 1032 states and 1688 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:39:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:04,602 INFO L93 Difference]: Finished difference Result 2595 states and 4294 transitions. [2025-02-05 15:39:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:04,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2025-02-05 15:39:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:04,612 INFO L225 Difference]: With dead ends: 2595 [2025-02-05 15:39:04,613 INFO L226 Difference]: Without dead ends: 1608 [2025-02-05 15:39:04,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 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:39:04,617 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 831 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1783 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:39:04,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1783 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2025-02-05 15:39:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606. [2025-02-05 15:39:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1245 states have (on average 1.6497991967871486) internal successors, (2054), 1291 states have internal predecessors, (2054), 286 states have call successors, (286), 70 states have call predecessors, (286), 74 states have return successors, (307), 269 states have call predecessors, (307), 281 states have call successors, (307) [2025-02-05 15:39:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2647 transitions. [2025-02-05 15:39:04,710 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2647 transitions. Word has length 145 [2025-02-05 15:39:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:04,710 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2647 transitions. [2025-02-05 15:39:04,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:39:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2647 transitions. [2025-02-05 15:39:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:39:04,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:04,715 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:04,725 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:39:04,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:39:04,919 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1872356978, now seen corresponding path program 1 times [2025-02-05 15:39:04,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951188022] [2025-02-05 15:39:04,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:04,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:04,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:39:04,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:39:04,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:04,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:05,044 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:39:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:05,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951188022] [2025-02-05 15:39:05,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951188022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:05,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923076374] [2025-02-05 15:39:05,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:05,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:05,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:05,047 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:39:05,051 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:39:05,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:39:05,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:39:05,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:05,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:05,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:05,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:05,368 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:39:05,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923076374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:05,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:05,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:39:05,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152077570] [2025-02-05 15:39:05,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:05,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:05,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:05,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:05,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:05,371 INFO L87 Difference]: Start difference. First operand 1606 states and 2647 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:39:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:05,499 INFO L93 Difference]: Finished difference Result 4319 states and 7199 transitions. [2025-02-05 15:39:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:05,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-02-05 15:39:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:05,518 INFO L225 Difference]: With dead ends: 4319 [2025-02-05 15:39:05,518 INFO L226 Difference]: Without dead ends: 2758 [2025-02-05 15:39:05,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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:39:05,527 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 830 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1740 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:39:05,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1740 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2025-02-05 15:39:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2755. [2025-02-05 15:39:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2130 states have (on average 1.6502347417840375) internal successors, (3515), 2208 states have internal predecessors, (3515), 496 states have call successors, (496), 118 states have call predecessors, (496), 128 states have return successors, (573), 477 states have call predecessors, (573), 491 states have call successors, (573) [2025-02-05 15:39:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 4584 transitions. [2025-02-05 15:39:05,685 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 4584 transitions. Word has length 146 [2025-02-05 15:39:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:05,687 INFO L471 AbstractCegarLoop]: Abstraction has 2755 states and 4584 transitions. [2025-02-05 15:39:05,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:39:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 4584 transitions. [2025-02-05 15:39:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:39:05,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:05,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:05,701 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:39:05,897 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,SelfDestructingSolverStorable16 [2025-02-05 15:39:05,897 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:05,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:05,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2086248412, now seen corresponding path program 1 times [2025-02-05 15:39:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:05,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787428865] [2025-02-05 15:39:05,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:05,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:05,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:39:05,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:39:05,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:05,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:06,017 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:39:06,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:06,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787428865] [2025-02-05 15:39:06,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787428865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:06,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753848064] [2025-02-05 15:39:06,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:06,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:06,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:06,020 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:39:06,025 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:39:06,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:39:06,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:39:06,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:06,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:06,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 1779 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:06,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:06,345 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:39:06,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:06,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753848064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:06,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:06,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:39:06,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824651705] [2025-02-05 15:39:06,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:06,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:06,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:06,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:06,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:06,348 INFO L87 Difference]: Start difference. First operand 2755 states and 4584 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:39:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:06,541 INFO L93 Difference]: Finished difference Result 7768 states and 13088 transitions. [2025-02-05 15:39:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:06,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2025-02-05 15:39:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:06,574 INFO L225 Difference]: With dead ends: 7768 [2025-02-05 15:39:06,574 INFO L226 Difference]: Without dead ends: 5058 [2025-02-05 15:39:06,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 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:39:06,591 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 829 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1731 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:39:06,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1731 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5058 states. [2025-02-05 15:39:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5058 to 5054. [2025-02-05 15:39:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5054 states, 3901 states have (on average 1.649833376057421) internal successors, (6436), 4043 states have internal predecessors, (6436), 916 states have call successors, (916), 214 states have call predecessors, (916), 236 states have return successors, (1159), 893 states have call predecessors, (1159), 911 states have call successors, (1159) [2025-02-05 15:39:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5054 states to 5054 states and 8511 transitions. [2025-02-05 15:39:06,862 INFO L78 Accepts]: Start accepts. Automaton has 5054 states and 8511 transitions. Word has length 147 [2025-02-05 15:39:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:06,862 INFO L471 AbstractCegarLoop]: Abstraction has 5054 states and 8511 transitions. [2025-02-05 15:39:06,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:39:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 8511 transitions. [2025-02-05 15:39:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:39:06,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:06,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:06,878 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:39:07,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:07,070 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:07,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:07,070 INFO L85 PathProgramCache]: Analyzing trace with hash 248960136, now seen corresponding path program 1 times [2025-02-05 15:39:07,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:07,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60514648] [2025-02-05 15:39:07,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:07,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:39:07,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:39:07,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:07,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:07,192 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:39:07,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60514648] [2025-02-05 15:39:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60514648] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655492747] [2025-02-05 15:39:07,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:07,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:07,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:07,195 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:39:07,196 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:39:07,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:39:07,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:39:07,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:07,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:07,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:07,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:07,518 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:39:07,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655492747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:39:07,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296213423] [2025-02-05 15:39:07,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:07,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:07,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:07,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:07,521 INFO L87 Difference]: Start difference. First operand 5054 states and 8511 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:39:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:07,999 INFO L93 Difference]: Finished difference Result 14667 states and 25117 transitions. [2025-02-05 15:39:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:08,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2025-02-05 15:39:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:08,172 INFO L225 Difference]: With dead ends: 14667 [2025-02-05 15:39:08,172 INFO L226 Difference]: Without dead ends: 9658 [2025-02-05 15:39:08,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 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:39:08,233 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 828 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1744 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:39:08,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1744 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9658 states. [2025-02-05 15:39:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9658 to 9653. [2025-02-05 15:39:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9653 states, 7444 states have (on average 1.648710370768404) internal successors, (12273), 7714 states have internal predecessors, (12273), 1756 states have call successors, (1756), 406 states have call predecessors, (1756), 452 states have return successors, (2505), 1725 states have call predecessors, (2505), 1751 states have call successors, (2505) [2025-02-05 15:39:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 16534 transitions. [2025-02-05 15:39:08,952 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 16534 transitions. Word has length 148 [2025-02-05 15:39:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:08,953 INFO L471 AbstractCegarLoop]: Abstraction has 9653 states and 16534 transitions. [2025-02-05 15:39:08,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:39:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 16534 transitions. [2025-02-05 15:39:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:39:08,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:08,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:08,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:39:09,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:09,161 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:09,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash 727488283, now seen corresponding path program 1 times [2025-02-05 15:39:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:09,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734294894] [2025-02-05 15:39:09,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:09,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:09,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:39:09,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:39:09,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:09,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:09,522 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:39:09,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734294894] [2025-02-05 15:39:09,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734294894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:09,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:09,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 15:39:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622778977] [2025-02-05 15:39:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:09,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:39:09,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:09,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:39:09,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:39:09,524 INFO L87 Difference]: Start difference. First operand 9653 states and 16534 transitions. Second operand has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 7 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2025-02-05 15:39:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:15,512 INFO L93 Difference]: Finished difference Result 35421 states and 62370 transitions. [2025-02-05 15:39:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 15:39:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 7 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 148 [2025-02-05 15:39:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:15,666 INFO L225 Difference]: With dead ends: 35421 [2025-02-05 15:39:15,666 INFO L226 Difference]: Without dead ends: 25813 [2025-02-05 15:39:15,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 15:39:15,721 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 2866 mSDsluCounter, 4897 mSDsCounter, 0 mSdLazyCounter, 12419 mSolverCounterSat, 897 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2941 SdHoareTripleChecker+Valid, 5474 SdHoareTripleChecker+Invalid, 13316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 897 IncrementalHoareTripleChecker+Valid, 12419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:15,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2941 Valid, 5474 Invalid, 13316 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [897 Valid, 12419 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-05 15:39:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25813 states. [2025-02-05 15:39:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25813 to 25082. [2025-02-05 15:39:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25082 states, 18699 states have (on average 1.6021712391036953) internal successors, (29959), 19465 states have internal predecessors, (29959), 5189 states have call successors, (5189), 981 states have call predecessors, (5189), 1193 states have return successors, (8008), 5163 states have call predecessors, (8008), 5184 states have call successors, (8008) [2025-02-05 15:39:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25082 states to 25082 states and 43156 transitions. [2025-02-05 15:39:16,946 INFO L78 Accepts]: Start accepts. Automaton has 25082 states and 43156 transitions. Word has length 148 [2025-02-05 15:39:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:16,947 INFO L471 AbstractCegarLoop]: Abstraction has 25082 states and 43156 transitions. [2025-02-05 15:39:16,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 7 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2025-02-05 15:39:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 25082 states and 43156 transitions. [2025-02-05 15:39:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:39:16,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:16,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:16,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:39:16,956 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:16,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash -872405354, now seen corresponding path program 1 times [2025-02-05 15:39:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:16,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638081203] [2025-02-05 15:39:16,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:16,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:39:16,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:39:16,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:16,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:17,054 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:39:17,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:17,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638081203] [2025-02-05 15:39:17,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638081203] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:17,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354150949] [2025-02-05 15:39:17,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:17,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:17,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:17,058 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:39:17,060 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:39:17,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:39:17,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:39:17,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:17,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:17,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 1783 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:17,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:17,341 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:39:17,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:17,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354150949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:17,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:17,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:39:17,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023439187] [2025-02-05 15:39:17,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:17,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:17,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:17,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:17,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:17,343 INFO L87 Difference]: Start difference. First operand 25082 states and 43156 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:39:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:19,021 INFO L93 Difference]: Finished difference Result 74044 states and 132871 transitions. [2025-02-05 15:39:19,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:19,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2025-02-05 15:39:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:19,424 INFO L225 Difference]: With dead ends: 74044 [2025-02-05 15:39:19,424 INFO L226 Difference]: Without dead ends: 48999 [2025-02-05 15:39:19,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 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:39:19,780 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 827 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1737 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:39:19,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1737 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48999 states. [2025-02-05 15:39:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48999 to 48993. [2025-02-05 15:39:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48993 states, 36499 states have (on average 1.598235568097756) internal successors, (58334), 38001 states have internal predecessors, (58334), 10165 states have call successors, (10165), 1909 states have call predecessors, (10165), 2328 states have return successors, (19185), 10138 states have call predecessors, (19185), 10160 states have call successors, (19185) [2025-02-05 15:39:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48993 states to 48993 states and 87684 transitions. [2025-02-05 15:39:21,923 INFO L78 Accepts]: Start accepts. Automaton has 48993 states and 87684 transitions. Word has length 149 [2025-02-05 15:39:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:21,924 INFO L471 AbstractCegarLoop]: Abstraction has 48993 states and 87684 transitions. [2025-02-05 15:39:21,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:39:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 48993 states and 87684 transitions. [2025-02-05 15:39:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 15:39:22,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:22,107 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:22,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:39:22,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:22,308 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:22,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash 714769941, now seen corresponding path program 1 times [2025-02-05 15:39:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:22,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215550860] [2025-02-05 15:39:22,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:22,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:22,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 15:39:22,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 15:39:22,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:22,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 15:39:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:22,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215550860] [2025-02-05 15:39:22,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215550860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:22,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265625959] [2025-02-05 15:39:22,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:22,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:22,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:22,464 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:39:22,467 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:39:22,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 15:39:22,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 15:39:22,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:22,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:22,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 2219 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:39:22,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 15:39:22,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265625959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:39:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82473683] [2025-02-05 15:39:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:22,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:39:22,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:22,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:39:22,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:22,997 INFO L87 Difference]: Start difference. First operand 48993 states and 87684 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:39:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:25,566 INFO L93 Difference]: Finished difference Result 98997 states and 186437 transitions. [2025-02-05 15:39:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:25,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 221 [2025-02-05 15:39:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:26,115 INFO L225 Difference]: With dead ends: 98997 [2025-02-05 15:39:26,116 INFO L226 Difference]: Without dead ends: 50049 [2025-02-05 15:39:26,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 219 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:26,380 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 817 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:26,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2163 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:39:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50049 states. [2025-02-05 15:39:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50049 to 50049. [2025-02-05 15:39:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50049 states, 37423 states have (on average 1.6011009272372605) internal successors, (59918), 38925 states have internal predecessors, (59918), 10165 states have call successors, (10165), 2041 states have call predecessors, (10165), 2460 states have return successors, (19284), 10138 states have call predecessors, (19284), 10160 states have call successors, (19284) [2025-02-05 15:39:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50049 states to 50049 states and 89367 transitions. [2025-02-05 15:39:28,751 INFO L78 Accepts]: Start accepts. Automaton has 50049 states and 89367 transitions. Word has length 221 [2025-02-05 15:39:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:28,751 INFO L471 AbstractCegarLoop]: Abstraction has 50049 states and 89367 transitions. [2025-02-05 15:39:28,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:39:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 50049 states and 89367 transitions. [2025-02-05 15:39:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 15:39:28,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:28,974 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:28,986 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:39:29,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 15:39:29,178 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:29,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1552393199, now seen corresponding path program 1 times [2025-02-05 15:39:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556105116] [2025-02-05 15:39:29,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:29,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:29,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 15:39:29,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 15:39:29,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:29,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 15:39:29,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:29,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556105116] [2025-02-05 15:39:29,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556105116] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:29,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134038871] [2025-02-05 15:39:29,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:29,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:29,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:29,297 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:39:29,299 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:39:29,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 15:39:29,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 15:39:29,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:29,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:29,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 2220 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:39:29,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 15:39:29,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:29,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134038871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:29,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:29,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:39:29,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563945816] [2025-02-05 15:39:29,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:29,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:39:29,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:29,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:39:29,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:29,671 INFO L87 Difference]: Start difference. First operand 50049 states and 89367 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:39:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:32,001 INFO L93 Difference]: Finished difference Result 101109 states and 189506 transitions. [2025-02-05 15:39:32,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:32,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 222 [2025-02-05 15:39:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:32,504 INFO L225 Difference]: With dead ends: 101109 [2025-02-05 15:39:32,505 INFO L226 Difference]: Without dead ends: 51105 [2025-02-05 15:39:32,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 220 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:32,907 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 811 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:32,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 2160 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:39:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51105 states. [2025-02-05 15:39:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51105 to 51105. [2025-02-05 15:39:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51105 states, 38347 states have (on average 1.6038282003807338) internal successors, (61502), 39849 states have internal predecessors, (61502), 10165 states have call successors, (10165), 2173 states have call predecessors, (10165), 2592 states have return successors, (19383), 10138 states have call predecessors, (19383), 10160 states have call successors, (19383) [2025-02-05 15:39:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51105 states to 51105 states and 91050 transitions. [2025-02-05 15:39:36,227 INFO L78 Accepts]: Start accepts. Automaton has 51105 states and 91050 transitions. Word has length 222 [2025-02-05 15:39:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:36,228 INFO L471 AbstractCegarLoop]: Abstraction has 51105 states and 91050 transitions. [2025-02-05 15:39:36,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:39:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 51105 states and 91050 transitions. [2025-02-05 15:39:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 15:39:36,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:36,248 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:36,258 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:39:36,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:36,452 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:36,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:36,457 INFO L85 PathProgramCache]: Analyzing trace with hash 278506392, now seen corresponding path program 1 times [2025-02-05 15:39:36,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:36,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391510702] [2025-02-05 15:39:36,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:36,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:36,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 15:39:36,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 15:39:36,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:36,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 15:39:36,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391510702] [2025-02-05 15:39:36,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391510702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822543058] [2025-02-05 15:39:36,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:36,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:36,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:36,617 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:39:36,619 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:39:36,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 15:39:36,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 15:39:36,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:36,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:36,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 2221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:39:36,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 15:39:37,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:37,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822543058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:37,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:37,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:39:37,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682374954] [2025-02-05 15:39:37,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:37,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:39:37,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:37,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:39:37,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:37,024 INFO L87 Difference]: Start difference. First operand 51105 states and 91050 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:39:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:39,296 INFO L93 Difference]: Finished difference Result 103221 states and 192575 transitions. [2025-02-05 15:39:39,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:39,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 223 [2025-02-05 15:39:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:39,700 INFO L225 Difference]: With dead ends: 103221 [2025-02-05 15:39:39,700 INFO L226 Difference]: Without dead ends: 52161 [2025-02-05 15:39:40,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 221 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:40,002 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 803 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:40,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 2157 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:39:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52161 states. [2025-02-05 15:39:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52161 to 52161. [2025-02-05 15:39:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52161 states, 39271 states have (on average 1.60642713452675) internal successors, (63086), 40773 states have internal predecessors, (63086), 10165 states have call successors, (10165), 2305 states have call predecessors, (10165), 2724 states have return successors, (19482), 10138 states have call predecessors, (19482), 10160 states have call successors, (19482) [2025-02-05 15:39:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52161 states to 52161 states and 92733 transitions. [2025-02-05 15:39:42,093 INFO L78 Accepts]: Start accepts. Automaton has 52161 states and 92733 transitions. Word has length 223 [2025-02-05 15:39:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:42,094 INFO L471 AbstractCegarLoop]: Abstraction has 52161 states and 92733 transitions. [2025-02-05 15:39:42,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:39:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 52161 states and 92733 transitions. [2025-02-05 15:39:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 15:39:42,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:42,110 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:42,119 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:39:42,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:42,314 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:42,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2027682990, now seen corresponding path program 1 times [2025-02-05 15:39:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:42,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112008778] [2025-02-05 15:39:42,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:42,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:42,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 15:39:42,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 15:39:42,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:42,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 15:39:42,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:42,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112008778] [2025-02-05 15:39:42,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112008778] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:42,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042966437] [2025-02-05 15:39:42,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:42,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:42,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:42,459 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:39:42,460 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:39:42,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 15:39:42,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 15:39:42,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:42,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:42,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 2222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:39:42,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 15:39:42,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:42,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042966437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:42,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:42,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:39:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352005283] [2025-02-05 15:39:42,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:42,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:39:42,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:42,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:39:42,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:42,854 INFO L87 Difference]: Start difference. First operand 52161 states and 92733 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)