./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e809cb7921b0f8738511433928ba20d09f78a0d0fe23412d97e6052fa9e13ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:35:15,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:35:15,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:35:15,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:35:15,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:35:15,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:35:15,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:35:15,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:35:15,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:35:15,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:35:15,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:35:15,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:35:15,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:35:15,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:35:15,192 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:35:15,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:35:15,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:35:15,193 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:35:15,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:35:15,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:35:15,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:35:15,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:35:15,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:35:15,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:35:15,193 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:35:15,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:35:15,194 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:35:15,194 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:35:15,194 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:35:15,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:35:15,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:35:15,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:35:15,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:35:15,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:35:15,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:35:15,194 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:35:15,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:35:15,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:35:15,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:35:15,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:35:15,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:35:15,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:35:15,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:35:15,195 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 -> 8e809cb7921b0f8738511433928ba20d09f78a0d0fe23412d97e6052fa9e13ec [2025-02-05 15:35:15,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:35:15,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:35:15,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:35:15,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:35:15,465 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:35:15,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c [2025-02-05 15:35:16,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/854cd816e/a9e42f7be5f64bbea89f96c94b8f1284/FLAGbeaa61ea5 [2025-02-05 15:35:17,001 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:35:17,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c [2025-02-05 15:35:17,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/854cd816e/a9e42f7be5f64bbea89f96c94b8f1284/FLAGbeaa61ea5 [2025-02-05 15:35:17,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/854cd816e/a9e42f7be5f64bbea89f96c94b8f1284 [2025-02-05 15:35:17,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:35:17,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:35:17,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:35:17,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:35:17,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:35:17,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2dd7a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17, skipping insertion in model container [2025-02-05 15:35:17,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:35:17,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c[1545,1558] [2025-02-05 15:35:17,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:35:17,731 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:35:17,737 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-02-05 15:35:17,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [57] [2025-02-05 15:35:17,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [421] [2025-02-05 15:35:17,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [541] [2025-02-05 15:35:17,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [907] [2025-02-05 15:35:17,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2442] [2025-02-05 15:35:17,740 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2533] [2025-02-05 15:35:17,740 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2714] [2025-02-05 15:35:17,740 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3375] [2025-02-05 15:35:17,740 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3387] [2025-02-05 15:35:17,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c[1545,1558] [2025-02-05 15:35:17,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:35:17,851 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:35:17,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17 WrapperNode [2025-02-05 15:35:17,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:35:17,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:35:17,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:35:17,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:35:17,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,916 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 1125 [2025-02-05 15:35:17,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:35:17,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:35:17,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:35:17,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:35:17,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,961 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:35:17,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:18,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:35:18,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:35:18,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:35:18,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:35:18,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:18,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:35:18,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:18,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:35:18,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:35:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:35:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:35:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:35:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:35:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:35:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-02-05 15:35:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-02-05 15:35:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:35:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:35:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:35:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:35:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:35:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:35:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:35:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:35:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:35:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:35:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:35:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:35:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:35:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:35:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:35:18,164 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:35:18,167 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:35:18,207 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: #res := ~retValue_acc~4; [2025-02-05 15:35:18,211 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: #res := ~retValue_acc~8; [2025-02-05 15:35:18,223 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1145: #res := ~retValue_acc~9; [2025-02-05 15:35:18,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1801: #res#1 := ~retValue_acc~19#1; [2025-02-05 15:35:18,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~11#1; [2025-02-05 15:35:18,292 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2430: #res := ~retValue_acc~23; [2025-02-05 15:35:18,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1682-1: stopRequestedInDirection__wrappee__empty_#res#1 := stopRequestedInDirection__wrappee__empty_~retValue_acc~16#1; [2025-02-05 15:35:18,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1711: #res#1 := ~retValue_acc~17#1; [2025-02-05 15:35:18,600 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846: #res := ~retValue_acc~21; [2025-02-05 15:35:18,610 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L499: #res := ~retValue_acc~3; [2025-02-05 15:35:18,663 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237-1: isEmpty_#res#1 := isEmpty_~retValue_acc~13#1; [2025-02-05 15:35:18,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; [2025-02-05 15:35:18,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1330-1: isIdle_#res#1 := isIdle_~retValue_acc~15#1; [2025-02-05 15:35:18,807 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1832-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-02-05 15:35:18,848 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3061: #res := ~retValue_acc~26; [2025-02-05 15:35:18,903 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3419-1: valid_product_#res#1 := valid_product_~retValue_acc~29#1; [2025-02-05 15:35:18,903 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L418-1: main_#res#1 := main_~retValue_acc~1#1; [2025-02-05 15:35:18,911 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2825: #res := ~retValue_acc~25; [2025-02-05 15:35:18,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1154: #res := ~retValue_acc~10; [2025-02-05 15:35:18,917 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3372: #res := ~retValue_acc~27; [2025-02-05 15:35:19,015 INFO L? ?]: Removed 443 outVars from TransFormulas that were not future-live. [2025-02-05 15:35:19,016 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:35:19,034 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:35:19,035 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:35:19,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:35:19 BoogieIcfgContainer [2025-02-05 15:35:19,035 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:35:19,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:35:19,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:35:19,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:35:19,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:35:17" (1/3) ... [2025-02-05 15:35:19,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c332b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:35:19, skipping insertion in model container [2025-02-05 15:35:19,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17" (2/3) ... [2025-02-05 15:35:19,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c332b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:35:19, skipping insertion in model container [2025-02-05 15:35:19,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:35:19" (3/3) ... [2025-02-05 15:35:19,045 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product11.cil.c [2025-02-05 15:35:19,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:35:19,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product11.cil.c that has 24 procedures, 554 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:35:19,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:35:19,114 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;@6486ec72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:35:19,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:35:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 554 states, 434 states have (on average 1.695852534562212) internal successors, (736), 456 states have internal predecessors, (736), 94 states have call successors, (94), 23 states have call predecessors, (94), 23 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) [2025-02-05 15:35:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:35:19,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:19,138 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] [2025-02-05 15:35:19,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:19,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:19,145 INFO L85 PathProgramCache]: Analyzing trace with hash 193659635, now seen corresponding path program 1 times [2025-02-05 15:35:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:19,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851435395] [2025-02-05 15:35:19,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:19,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:35:19,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:35:19,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:19,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:19,622 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:35:19,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:19,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851435395] [2025-02-05 15:35:19,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851435395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:19,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:19,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:19,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092755439] [2025-02-05 15:35:19,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:19,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:19,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:19,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:19,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:19,647 INFO L87 Difference]: Start difference. First operand has 554 states, 434 states have (on average 1.695852534562212) internal successors, (736), 456 states have internal predecessors, (736), 94 states have call successors, (94), 23 states have call predecessors, (94), 23 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:19,760 INFO L93 Difference]: Finished difference Result 1088 states and 1822 transitions. [2025-02-05 15:35:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:19,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2025-02-05 15:35:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:19,776 INFO L225 Difference]: With dead ends: 1088 [2025-02-05 15:35:19,776 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:35:19,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:19,784 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 5 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:19,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2708 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:35:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:35:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.689252336448598) internal successors, (723), 447 states have internal predecessors, (723), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 906 transitions. [2025-02-05 15:35:19,857 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 906 transitions. Word has length 120 [2025-02-05 15:35:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:19,858 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 906 transitions. [2025-02-05 15:35:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 906 transitions. [2025-02-05 15:35:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:35:19,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:19,865 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] [2025-02-05 15:35:19,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:35:19,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:19,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash 717359266, now seen corresponding path program 1 times [2025-02-05 15:35:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503508457] [2025-02-05 15:35:19,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:19,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:35:19,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:35:19,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:19,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:20,086 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:35:20,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:20,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503508457] [2025-02-05 15:35:20,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503508457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:20,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:20,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:20,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008100876] [2025-02-05 15:35:20,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:20,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:20,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:20,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:20,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:20,091 INFO L87 Difference]: Start difference. First operand 545 states and 906 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:20,149 INFO L93 Difference]: Finished difference Result 1072 states and 1789 transitions. [2025-02-05 15:35:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:20,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-02-05 15:35:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:20,155 INFO L225 Difference]: With dead ends: 1072 [2025-02-05 15:35:20,155 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:35:20,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:20,158 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 4 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:20,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2681 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:35:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:35:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6869158878504673) internal successors, (722), 447 states have internal predecessors, (722), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 905 transitions. [2025-02-05 15:35:20,193 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 905 transitions. Word has length 121 [2025-02-05 15:35:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:20,194 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 905 transitions. [2025-02-05 15:35:20,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 905 transitions. [2025-02-05 15:35:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:35:20,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:20,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:20,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:35:20,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:20,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:20,202 INFO L85 PathProgramCache]: Analyzing trace with hash -175819472, now seen corresponding path program 1 times [2025-02-05 15:35:20,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:20,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505396856] [2025-02-05 15:35:20,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:20,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:20,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:35:20,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:35:20,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:20,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:20,374 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:35:20,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505396856] [2025-02-05 15:35:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505396856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:20,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:20,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:20,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129412078] [2025-02-05 15:35:20,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:20,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:20,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:20,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:20,376 INFO L87 Difference]: Start difference. First operand 545 states and 905 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:20,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:20,431 INFO L93 Difference]: Finished difference Result 1072 states and 1788 transitions. [2025-02-05 15:35:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:20,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 122 [2025-02-05 15:35:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:20,438 INFO L225 Difference]: With dead ends: 1072 [2025-02-05 15:35:20,438 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:35:20,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:20,444 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 3 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:20,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2681 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:35:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:35:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6845794392523366) internal successors, (721), 447 states have internal predecessors, (721), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 904 transitions. [2025-02-05 15:35:20,472 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 904 transitions. Word has length 122 [2025-02-05 15:35:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:20,472 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 904 transitions. [2025-02-05 15:35:20,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 904 transitions. [2025-02-05 15:35:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:35:20,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:20,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:20,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:35:20,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:20,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2042554689, now seen corresponding path program 1 times [2025-02-05 15:35:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:20,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694993911] [2025-02-05 15:35:20,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:20,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:20,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:35:20,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:35:20,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:20,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:20,629 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:35:20,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694993911] [2025-02-05 15:35:20,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694993911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:20,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:20,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:20,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532269959] [2025-02-05 15:35:20,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:20,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:20,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:20,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:20,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:20,633 INFO L87 Difference]: Start difference. First operand 545 states and 904 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:20,673 INFO L93 Difference]: Finished difference Result 1072 states and 1787 transitions. [2025-02-05 15:35:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:20,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-02-05 15:35:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:20,677 INFO L225 Difference]: With dead ends: 1072 [2025-02-05 15:35:20,677 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:35:20,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:20,681 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 2 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:20,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2681 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:35:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:35:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6822429906542056) internal successors, (720), 447 states have internal predecessors, (720), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 903 transitions. [2025-02-05 15:35:20,707 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 903 transitions. Word has length 123 [2025-02-05 15:35:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:20,707 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 903 transitions. [2025-02-05 15:35:20,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 903 transitions. [2025-02-05 15:35:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:35:20,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:20,712 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:20,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:35:20,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:20,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash 270197613, now seen corresponding path program 1 times [2025-02-05 15:35:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259213804] [2025-02-05 15:35:20,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:20,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:35:20,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:35:20,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:20,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:20,842 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:35:20,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:20,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259213804] [2025-02-05 15:35:20,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259213804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:20,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:20,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380649979] [2025-02-05 15:35:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:20,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:20,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:20,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:20,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:20,845 INFO L87 Difference]: Start difference. First operand 545 states and 903 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:20,883 INFO L93 Difference]: Finished difference Result 1072 states and 1786 transitions. [2025-02-05 15:35:20,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2025-02-05 15:35:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:20,887 INFO L225 Difference]: With dead ends: 1072 [2025-02-05 15:35:20,887 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:35:20,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:20,890 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 1 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:20,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2681 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:35:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:35:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6799065420560748) internal successors, (719), 447 states have internal predecessors, (719), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 902 transitions. [2025-02-05 15:35:20,910 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 902 transitions. Word has length 124 [2025-02-05 15:35:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:20,910 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 902 transitions. [2025-02-05 15:35:20,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 902 transitions. [2025-02-05 15:35:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:35:20,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:20,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:20,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:35:20,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:20,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash -996923172, now seen corresponding path program 1 times [2025-02-05 15:35:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:20,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068872416] [2025-02-05 15:35:20,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:20,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:20,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:35:20,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:35:20,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:20,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:21,144 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:35:21,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:21,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068872416] [2025-02-05 15:35:21,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068872416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:21,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:21,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:35:21,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224881366] [2025-02-05 15:35:21,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:21,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:35:21,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:21,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:35:21,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:21,147 INFO L87 Difference]: Start difference. First operand 545 states and 902 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:35:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:21,249 INFO L93 Difference]: Finished difference Result 1038 states and 1718 transitions. [2025-02-05 15:35:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:35:21,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2025-02-05 15:35:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:21,253 INFO L225 Difference]: With dead ends: 1038 [2025-02-05 15:35:21,253 INFO L226 Difference]: Without dead ends: 560 [2025-02-05 15:35:21,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:21,257 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 91 mSDsluCounter, 6147 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7037 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:21,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7037 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-02-05 15:35:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 558. [2025-02-05 15:35:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 438 states have (on average 1.6757990867579908) internal successors, (734), 459 states have internal predecessors, (734), 95 states have call successors, (95), 23 states have call predecessors, (95), 24 states have return successors, (92), 88 states have call predecessors, (92), 90 states have call successors, (92) [2025-02-05 15:35:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 921 transitions. [2025-02-05 15:35:21,278 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 921 transitions. Word has length 125 [2025-02-05 15:35:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:21,278 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 921 transitions. [2025-02-05 15:35:21,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:35:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 921 transitions. [2025-02-05 15:35:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:35:21,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:21,282 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:21,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:35:21,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:21,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:21,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1983505861, now seen corresponding path program 1 times [2025-02-05 15:35:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:21,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36728091] [2025-02-05 15:35:21,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:21,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:21,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:35:21,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:35:21,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:21,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:21,361 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:35:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36728091] [2025-02-05 15:35:21,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36728091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:21,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:21,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:21,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759183662] [2025-02-05 15:35:21,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:21,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:21,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:21,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:21,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:21,363 INFO L87 Difference]: Start difference. First operand 558 states and 921 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:21,395 INFO L93 Difference]: Finished difference Result 1090 states and 1812 transitions. [2025-02-05 15:35:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:21,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-02-05 15:35:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:21,402 INFO L225 Difference]: With dead ends: 1090 [2025-02-05 15:35:21,402 INFO L226 Difference]: Without dead ends: 539 [2025-02-05 15:35:21,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:21,405 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 0 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:21,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2683 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-05 15:35:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-02-05 15:35:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 422 states have (on average 1.6706161137440758) internal successors, (705), 441 states have internal predecessors, (705), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 888 transitions. [2025-02-05 15:35:21,430 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 888 transitions. Word has length 125 [2025-02-05 15:35:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:21,430 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 888 transitions. [2025-02-05 15:35:21,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 888 transitions. [2025-02-05 15:35:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:35:21,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:21,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:21,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:35:21,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:21,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash -159936259, now seen corresponding path program 1 times [2025-02-05 15:35:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:21,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184000162] [2025-02-05 15:35:21,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:21,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:35:21,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:35:21,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:21,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:21,588 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:35:21,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:21,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184000162] [2025-02-05 15:35:21,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184000162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:21,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:21,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:21,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322196494] [2025-02-05 15:35:21,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:21,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:21,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:21,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:21,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:21,590 INFO L87 Difference]: Start difference. First operand 539 states and 888 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:21,747 INFO L93 Difference]: Finished difference Result 1035 states and 1710 transitions. [2025-02-05 15:35:21,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:21,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2025-02-05 15:35:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:21,751 INFO L225 Difference]: With dead ends: 1035 [2025-02-05 15:35:21,752 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 15:35:21,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:21,754 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 55 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4196 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:21,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4196 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 15:35:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 539. [2025-02-05 15:35:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 422 states have (on average 1.661137440758294) internal successors, (701), 441 states have internal predecessors, (701), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 884 transitions. [2025-02-05 15:35:21,771 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 884 transitions. Word has length 126 [2025-02-05 15:35:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:21,771 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 884 transitions. [2025-02-05 15:35:21,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:21,772 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 884 transitions. [2025-02-05 15:35:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:35:21,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:21,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:21,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:35:21,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:21,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:21,776 INFO L85 PathProgramCache]: Analyzing trace with hash 174861075, now seen corresponding path program 1 times [2025-02-05 15:35:21,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:21,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126119959] [2025-02-05 15:35:21,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:21,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:21,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:35:21,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:35:21,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:21,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:21,926 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:35:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126119959] [2025-02-05 15:35:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126119959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:21,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58530508] [2025-02-05 15:35:21,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:21,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:21,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:21,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:21,928 INFO L87 Difference]: Start difference. First operand 539 states and 884 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:22,074 INFO L93 Difference]: Finished difference Result 1035 states and 1706 transitions. [2025-02-05 15:35:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:22,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2025-02-05 15:35:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:22,079 INFO L225 Difference]: With dead ends: 1035 [2025-02-05 15:35:22,079 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 15:35:22,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:22,083 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 54 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4196 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:22,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4196 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 15:35:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 539. [2025-02-05 15:35:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 422 states have (on average 1.6516587677725119) internal successors, (697), 441 states have internal predecessors, (697), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 880 transitions. [2025-02-05 15:35:22,102 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 880 transitions. Word has length 127 [2025-02-05 15:35:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:22,103 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 880 transitions. [2025-02-05 15:35:22,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 880 transitions. [2025-02-05 15:35:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:35:22,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:22,106 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:22,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:35:22,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:22,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:22,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1029297664, now seen corresponding path program 1 times [2025-02-05 15:35:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:22,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669874270] [2025-02-05 15:35:22,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:22,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:35:22,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:35:22,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:22,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:22,236 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:35:22,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:22,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669874270] [2025-02-05 15:35:22,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669874270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:22,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:22,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373680310] [2025-02-05 15:35:22,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:22,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:22,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:22,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:22,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:22,238 INFO L87 Difference]: Start difference. First operand 539 states and 880 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:22,365 INFO L93 Difference]: Finished difference Result 1035 states and 1702 transitions. [2025-02-05 15:35:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-02-05 15:35:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:22,370 INFO L225 Difference]: With dead ends: 1035 [2025-02-05 15:35:22,370 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 15:35:22,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:22,372 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 53 mSDsluCounter, 3334 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4178 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:22,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4178 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 15:35:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 539. [2025-02-05 15:35:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 422 states have (on average 1.6421800947867298) internal successors, (693), 441 states have internal predecessors, (693), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 876 transitions. [2025-02-05 15:35:22,388 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 876 transitions. Word has length 128 [2025-02-05 15:35:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:22,389 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 876 transitions. [2025-02-05 15:35:22,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 876 transitions. [2025-02-05 15:35:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:35:22,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:22,392 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:22,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:35:22,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:22,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash -441038417, now seen corresponding path program 1 times [2025-02-05 15:35:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:22,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957131428] [2025-02-05 15:35:22,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:22,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:35:22,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:35:22,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:22,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:35:22,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957131428] [2025-02-05 15:35:22,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957131428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:22,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:22,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:35:22,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172876718] [2025-02-05 15:35:22,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:22,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:35:22,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:22,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:35:22,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:22,546 INFO L87 Difference]: Start difference. First operand 539 states and 876 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:35:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:22,608 INFO L93 Difference]: Finished difference Result 1026 states and 1684 transitions. [2025-02-05 15:35:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:35:22,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 128 [2025-02-05 15:35:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:22,613 INFO L225 Difference]: With dead ends: 1026 [2025-02-05 15:35:22,613 INFO L226 Difference]: Without dead ends: 518 [2025-02-05 15:35:22,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:35:22,616 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 84 mSDsluCounter, 4252 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5117 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:22,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5117 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-05 15:35:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-02-05 15:35:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6433915211970074) internal successors, (659), 420 states have internal predecessors, (659), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 842 transitions. [2025-02-05 15:35:22,634 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 842 transitions. Word has length 128 [2025-02-05 15:35:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:22,634 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 842 transitions. [2025-02-05 15:35:22,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:35:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 842 transitions. [2025-02-05 15:35:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:35:22,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:22,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:22,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:35:22,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:22,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 812681974, now seen corresponding path program 1 times [2025-02-05 15:35:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:22,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744391435] [2025-02-05 15:35:22,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:22,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:35:22,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:35:22,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:22,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:22,766 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:35:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744391435] [2025-02-05 15:35:22,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744391435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:22,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157026658] [2025-02-05 15:35:22,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:22,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:22,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:22,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:22,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:22,768 INFO L87 Difference]: Start difference. First operand 518 states and 842 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:22,831 INFO L93 Difference]: Finished difference Result 1005 states and 1650 transitions. [2025-02-05 15:35:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:22,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-02-05 15:35:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:22,836 INFO L225 Difference]: With dead ends: 1005 [2025-02-05 15:35:22,837 INFO L226 Difference]: Without dead ends: 518 [2025-02-05 15:35:22,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:22,839 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 17 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:22,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4116 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-05 15:35:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-02-05 15:35:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6408977556109725) internal successors, (658), 420 states have internal predecessors, (658), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 841 transitions. [2025-02-05 15:35:22,856 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 841 transitions. Word has length 129 [2025-02-05 15:35:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:22,856 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 841 transitions. [2025-02-05 15:35:22,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 841 transitions. [2025-02-05 15:35:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:35:22,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:22,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:22,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:35:22,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:22,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1753184003, now seen corresponding path program 1 times [2025-02-05 15:35:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:22,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689660170] [2025-02-05 15:35:22,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:22,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:35:22,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:35:22,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:22,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:35:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689660170] [2025-02-05 15:35:22,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689660170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:22,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:22,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071515403] [2025-02-05 15:35:22,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:22,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:22,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:22,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:22,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:22,978 INFO L87 Difference]: Start difference. First operand 518 states and 841 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:23,036 INFO L93 Difference]: Finished difference Result 1005 states and 1649 transitions. [2025-02-05 15:35:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:23,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-02-05 15:35:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:23,040 INFO L225 Difference]: With dead ends: 1005 [2025-02-05 15:35:23,040 INFO L226 Difference]: Without dead ends: 518 [2025-02-05 15:35:23,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:23,043 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 16 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:23,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4116 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-05 15:35:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-02-05 15:35:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6384039900249376) internal successors, (657), 420 states have internal predecessors, (657), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 840 transitions. [2025-02-05 15:35:23,058 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 840 transitions. Word has length 130 [2025-02-05 15:35:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:23,059 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 840 transitions. [2025-02-05 15:35:23,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 840 transitions. [2025-02-05 15:35:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:35:23,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:23,062 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:23,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:35:23,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:23,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash -90370343, now seen corresponding path program 1 times [2025-02-05 15:35:23,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:23,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492960594] [2025-02-05 15:35:23,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:23,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:23,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:35:23,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:35:23,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:23,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:23,275 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:35:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492960594] [2025-02-05 15:35:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492960594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:23,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:23,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:35:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621813772] [2025-02-05 15:35:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:23,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:35:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:23,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:35:23,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:23,277 INFO L87 Difference]: Start difference. First operand 518 states and 840 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:35:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:23,373 INFO L93 Difference]: Finished difference Result 999 states and 1637 transitions. [2025-02-05 15:35:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:35:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 131 [2025-02-05 15:35:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:23,378 INFO L225 Difference]: With dead ends: 999 [2025-02-05 15:35:23,378 INFO L226 Difference]: Without dead ends: 518 [2025-02-05 15:35:23,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:23,382 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 6 mSDsluCounter, 6570 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7394 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:23,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7394 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-05 15:35:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-02-05 15:35:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6359102244389028) internal successors, (656), 420 states have internal predecessors, (656), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 15:35:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 839 transitions. [2025-02-05 15:35:23,403 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 839 transitions. Word has length 131 [2025-02-05 15:35:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:23,404 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 839 transitions. [2025-02-05 15:35:23,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:35:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 839 transitions. [2025-02-05 15:35:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:35:23,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:23,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:23,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:35:23,407 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:23,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1987718198, now seen corresponding path program 1 times [2025-02-05 15:35:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:23,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433997868] [2025-02-05 15:35:23,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:23,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:35:23,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:35:23,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:23,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:23,546 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:35:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433997868] [2025-02-05 15:35:23,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433997868] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52428119] [2025-02-05 15:35:23,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:23,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:23,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:23,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:35:23,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:35:23,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:35:23,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:35:23,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:23,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:23,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 1484 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:35:23,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:35:23,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52428119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:23,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:35:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803071420] [2025-02-05 15:35:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:23,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:35:23,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:23,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:35:23,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:23,963 INFO L87 Difference]: Start difference. First operand 518 states and 839 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:35:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:24,380 INFO L93 Difference]: Finished difference Result 999 states and 1659 transitions. [2025-02-05 15:35:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:24,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-02-05 15:35:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:24,384 INFO L225 Difference]: With dead ends: 999 [2025-02-05 15:35:24,384 INFO L226 Difference]: Without dead ends: 526 [2025-02-05 15:35:24,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 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:35:24,387 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 795 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:24,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2103 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:35:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-05 15:35:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-02-05 15:35:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 408 states have (on average 1.6372549019607843) internal successors, (668), 427 states have internal predecessors, (668), 94 states have call successors, (94), 24 states have call predecessors, (94), 23 states have return successors, (90), 87 states have call predecessors, (90), 89 states have call successors, (90) [2025-02-05 15:35:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 852 transitions. [2025-02-05 15:35:24,403 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 852 transitions. Word has length 132 [2025-02-05 15:35:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:24,403 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 852 transitions. [2025-02-05 15:35:24,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:35:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 852 transitions. [2025-02-05 15:35:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:35:24,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:24,406 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:35:24,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:35:24,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:35:24,608 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:24,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1867333078, now seen corresponding path program 1 times [2025-02-05 15:35:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173225843] [2025-02-05 15:35:24,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:24,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:24,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:35:24,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:35:24,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:24,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:35:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:24,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173225843] [2025-02-05 15:35:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173225843] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:24,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478407539] [2025-02-05 15:35:24,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:24,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:24,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:24,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:35:24,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:35:24,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:35:24,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:35:24,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:24,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:24,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:35:24,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:35:25,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:25,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478407539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:25,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:25,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:35:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948848758] [2025-02-05 15:35:25,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:25,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:35:25,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:25,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:35:25,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:25,096 INFO L87 Difference]: Start difference. First operand 526 states and 852 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:35:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:25,558 INFO L93 Difference]: Finished difference Result 1015 states and 1682 transitions. [2025-02-05 15:35:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:25,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-02-05 15:35:25,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:25,563 INFO L225 Difference]: With dead ends: 1015 [2025-02-05 15:35:25,563 INFO L226 Difference]: Without dead ends: 534 [2025-02-05 15:35:25,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 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:35:25,566 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 786 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:25,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2100 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:35:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-05 15:35:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-02-05 15:35:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 415 states have (on average 1.6385542168674698) internal successors, (680), 434 states have internal predecessors, (680), 94 states have call successors, (94), 25 states have call predecessors, (94), 24 states have return successors, (91), 87 states have call predecessors, (91), 89 states have call successors, (91) [2025-02-05 15:35:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 865 transitions. [2025-02-05 15:35:25,582 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 865 transitions. Word has length 134 [2025-02-05 15:35:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:25,582 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 865 transitions. [2025-02-05 15:35:25,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:35:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 865 transitions. [2025-02-05 15:35:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:35:25,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:25,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:25,593 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:35:25,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:35:25,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:25,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:25,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1571772778, now seen corresponding path program 1 times [2025-02-05 15:35:25,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:25,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79317629] [2025-02-05 15:35:25,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:25,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:25,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:35:25,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:35:25,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:25,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:35:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:25,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79317629] [2025-02-05 15:35:25,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79317629] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:25,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105375496] [2025-02-05 15:35:25,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:25,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:25,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:25,899 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:35:25,901 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:35:26,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:35:26,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:35:26,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:26,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:26,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:35:26,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:35:26,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105375496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:26,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:26,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:35:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591500787] [2025-02-05 15:35:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:26,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:35:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:26,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:35:26,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:26,258 INFO L87 Difference]: Start difference. First operand 534 states and 865 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:35:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:26,659 INFO L93 Difference]: Finished difference Result 1031 states and 1705 transitions. [2025-02-05 15:35:26,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:26,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-02-05 15:35:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:26,664 INFO L225 Difference]: With dead ends: 1031 [2025-02-05 15:35:26,664 INFO L226 Difference]: Without dead ends: 542 [2025-02-05 15:35:26,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 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:35:26,667 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 779 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:26,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2097 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:35:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-02-05 15:35:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-02-05 15:35:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 422 states have (on average 1.6398104265402844) internal successors, (692), 441 states have internal predecessors, (692), 94 states have call successors, (94), 26 states have call predecessors, (94), 25 states have return successors, (92), 87 states have call predecessors, (92), 89 states have call successors, (92) [2025-02-05 15:35:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 878 transitions. [2025-02-05 15:35:26,684 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 878 transitions. Word has length 136 [2025-02-05 15:35:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:26,684 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 878 transitions. [2025-02-05 15:35:26,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:35:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 878 transitions. [2025-02-05 15:35:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:35:26,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:26,687 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:26,696 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:35:26,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:26,891 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:26,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:26,891 INFO L85 PathProgramCache]: Analyzing trace with hash 938184740, now seen corresponding path program 1 times [2025-02-05 15:35:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:26,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915872452] [2025-02-05 15:35:26,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:26,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:26,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:35:26,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:35:26,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:26,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:35:27,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:27,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915872452] [2025-02-05 15:35:27,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915872452] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:27,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003612199] [2025-02-05 15:35:27,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:27,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:27,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:27,015 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:35:27,017 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:35:27,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:35:27,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:35:27,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:27,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:27,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:35:27,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:35:27,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:27,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003612199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:27,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:27,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:35:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865980547] [2025-02-05 15:35:27,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:27,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:35:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:27,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:35:27,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:27,338 INFO L87 Difference]: Start difference. First operand 542 states and 878 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:35:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:27,698 INFO L93 Difference]: Finished difference Result 1047 states and 1728 transitions. [2025-02-05 15:35:27,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:27,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-02-05 15:35:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:27,702 INFO L225 Difference]: With dead ends: 1047 [2025-02-05 15:35:27,702 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 15:35:27,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 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:35:27,704 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 784 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:27,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2094 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:35:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 15:35:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-02-05 15:35:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 429 states have (on average 1.641025641025641) internal successors, (704), 448 states have internal predecessors, (704), 94 states have call successors, (94), 27 states have call predecessors, (94), 26 states have return successors, (93), 87 states have call predecessors, (93), 89 states have call successors, (93) [2025-02-05 15:35:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 891 transitions. [2025-02-05 15:35:27,721 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 891 transitions. Word has length 138 [2025-02-05 15:35:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:27,721 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 891 transitions. [2025-02-05 15:35:27,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:35:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 891 transitions. [2025-02-05 15:35:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:35:27,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:27,725 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:27,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:35:27,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 15:35:27,926 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:27,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1909213322, now seen corresponding path program 1 times [2025-02-05 15:35:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:27,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732127615] [2025-02-05 15:35:27,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:27,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:35:27,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:35:27,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:27,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:35:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:28,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732127615] [2025-02-05 15:35:28,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732127615] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:28,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927979964] [2025-02-05 15:35:28,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:28,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:28,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:28,159 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:35:28,162 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:35:28,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:35:28,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:35:28,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:28,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:28,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 15:35:28,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:35:28,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:28,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927979964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:28,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:28,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-02-05 15:35:28,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640822219] [2025-02-05 15:35:28,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:28,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:35:28,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:28,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:35:28,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:35:28,589 INFO L87 Difference]: Start difference. First operand 550 states and 891 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-05 15:35:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:31,087 INFO L93 Difference]: Finished difference Result 1894 states and 3136 transitions. [2025-02-05 15:35:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 15:35:31,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 140 [2025-02-05 15:35:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:31,099 INFO L225 Difference]: With dead ends: 1894 [2025-02-05 15:35:31,099 INFO L226 Difference]: Without dead ends: 1389 [2025-02-05 15:35:31,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:35:31,102 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 2322 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 4605 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2405 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 5111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 4605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:31,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2405 Valid, 2744 Invalid, 5111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 4605 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 15:35:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2025-02-05 15:35:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1275. [2025-02-05 15:35:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1000 states have (on average 1.663) internal successors, (1663), 1039 states have internal predecessors, (1663), 210 states have call successors, (210), 59 states have call predecessors, (210), 64 states have return successors, (229), 202 states have call predecessors, (229), 205 states have call successors, (229) [2025-02-05 15:35:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2102 transitions. [2025-02-05 15:35:31,174 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2102 transitions. Word has length 140 [2025-02-05 15:35:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:31,174 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 2102 transitions. [2025-02-05 15:35:31,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-05 15:35:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2102 transitions. [2025-02-05 15:35:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:35:31,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:31,178 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:31,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:35:31,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:31,379 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:31,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1191097436, now seen corresponding path program 1 times [2025-02-05 15:35:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905177367] [2025-02-05 15:35:31,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:31,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:35:31,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:35:31,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:31,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:35:31,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905177367] [2025-02-05 15:35:31,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905177367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520972313] [2025-02-05 15:35:31,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:31,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:31,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:31,602 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:35:31,603 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:35:31,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:35:31,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:35:31,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:31,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:31,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 15:35:31,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:35:31,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520972313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:31,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-02-05 15:35:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413149403] [2025-02-05 15:35:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:31,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:35:31,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:31,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:35:31,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:35:31,975 INFO L87 Difference]: Start difference. First operand 1275 states and 2102 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:35:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:33,715 INFO L93 Difference]: Finished difference Result 2763 states and 4577 transitions. [2025-02-05 15:35:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:35:33,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 142 [2025-02-05 15:35:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:33,724 INFO L225 Difference]: With dead ends: 2763 [2025-02-05 15:35:33,724 INFO L226 Difference]: Without dead ends: 1533 [2025-02-05 15:35:33,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:35:33,730 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 2072 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 3283 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 3751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 3283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:33,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 2023 Invalid, 3751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 3283 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 15:35:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-02-05 15:35:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1346. [2025-02-05 15:35:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1052 states have (on average 1.6492395437262357) internal successors, (1735), 1097 states have internal predecessors, (1735), 218 states have call successors, (218), 64 states have call predecessors, (218), 75 states have return successors, (255), 210 states have call predecessors, (255), 213 states have call successors, (255) [2025-02-05 15:35:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2208 transitions. [2025-02-05 15:35:33,786 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 2208 transitions. Word has length 142 [2025-02-05 15:35:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:33,786 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 2208 transitions. [2025-02-05 15:35:33,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:35:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 2208 transitions. [2025-02-05 15:35:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:35:33,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:33,789 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:33,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:35:33,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:33,993 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:33,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1363408580, now seen corresponding path program 1 times [2025-02-05 15:35:33,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:33,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754785625] [2025-02-05 15:35:33,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:34,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:35:34,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:35:34,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:34,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:35:34,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754785625] [2025-02-05 15:35:34,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754785625] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488036503] [2025-02-05 15:35:34,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:34,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:34,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:34,204 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:35:34,205 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:35:34,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:35:34,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:35:34,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:34,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:34,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:35:34,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:35:34,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:34,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488036503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:34,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:34,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-02-05 15:35:34,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736460558] [2025-02-05 15:35:34,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:34,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:35:34,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:34,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:35:34,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:35:34,442 INFO L87 Difference]: Start difference. First operand 1346 states and 2208 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:35:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:34,502 INFO L93 Difference]: Finished difference Result 3337 states and 5542 transitions. [2025-02-05 15:35:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:35:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-02-05 15:35:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:34,512 INFO L225 Difference]: With dead ends: 3337 [2025-02-05 15:35:34,512 INFO L226 Difference]: Without dead ends: 2037 [2025-02-05 15:35:34,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:35:34,518 INFO L435 NwaCegarLoop]: 1489 mSDtfsCounter, 780 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:34,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 2318 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2025-02-05 15:35:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1342. [2025-02-05 15:35:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1050 states have (on average 1.6485714285714286) internal successors, (1731), 1093 states have internal predecessors, (1731), 218 states have call successors, (218), 64 states have call predecessors, (218), 73 states have return successors, (246), 210 states have call predecessors, (246), 213 states have call successors, (246) [2025-02-05 15:35:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2195 transitions. [2025-02-05 15:35:34,575 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2195 transitions. Word has length 147 [2025-02-05 15:35:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:34,575 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 2195 transitions. [2025-02-05 15:35:34,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:35:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2195 transitions. [2025-02-05 15:35:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:35:34,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:34,578 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:34,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 15:35:34,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:34,782 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:34,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:34,782 INFO L85 PathProgramCache]: Analyzing trace with hash 914711941, now seen corresponding path program 1 times [2025-02-05 15:35:34,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:34,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629385411] [2025-02-05 15:35:34,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:34,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:34,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:35:34,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:35:34,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:34,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:35:34,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629385411] [2025-02-05 15:35:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629385411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:34,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365810204] [2025-02-05 15:35:34,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:34,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:34,974 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:35:34,976 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:35:35,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:35:35,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:35:35,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:35,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:35,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:35:35,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:35:35,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365810204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:35,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:35,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:35:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982263474] [2025-02-05 15:35:35,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:35,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:35,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:35,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:35:35,312 INFO L87 Difference]: Start difference. First operand 1342 states and 2195 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:35:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:36,398 INFO L93 Difference]: Finished difference Result 4203 states and 6992 transitions. [2025-02-05 15:35:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:36,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 147 [2025-02-05 15:35:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:36,414 INFO L225 Difference]: With dead ends: 4203 [2025-02-05 15:35:36,414 INFO L226 Difference]: Without dead ends: 2906 [2025-02-05 15:35:36,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:35:36,418 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 1856 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1932 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:36,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1932 Valid, 912 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:35:36,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2025-02-05 15:35:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2794. [2025-02-05 15:35:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2794 states, 2157 states have (on average 1.6504404265183126) internal successors, (3560), 2253 states have internal predecessors, (3560), 487 states have call successors, (487), 123 states have call predecessors, (487), 149 states have return successors, (595), 479 states have call predecessors, (595), 482 states have call successors, (595) [2025-02-05 15:35:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 4642 transitions. [2025-02-05 15:35:36,512 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 4642 transitions. Word has length 147 [2025-02-05 15:35:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:36,512 INFO L471 AbstractCegarLoop]: Abstraction has 2794 states and 4642 transitions. [2025-02-05 15:35:36,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:35:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 4642 transitions. [2025-02-05 15:35:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:35:36,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:36,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:36,524 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:35:36,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:36,716 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:36,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:36,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1708878824, now seen corresponding path program 1 times [2025-02-05 15:35:36,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:36,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837140925] [2025-02-05 15:35:36,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:36,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:36,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:35:36,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:35:36,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:36,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:35:36,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:36,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837140925] [2025-02-05 15:35:36,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837140925] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:36,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493045638] [2025-02-05 15:35:36,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:36,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:36,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:36,923 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:35:36,925 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:35:37,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:35:37,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:35:37,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:37,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:37,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:35:37,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:35:37,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:37,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493045638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:37,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:37,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:35:37,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840573773] [2025-02-05 15:35:37,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:37,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:37,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:37,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:37,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:35:37,245 INFO L87 Difference]: Start difference. First operand 2794 states and 4642 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:35:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:38,424 INFO L93 Difference]: Finished difference Result 8986 states and 15237 transitions. [2025-02-05 15:35:38,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:38,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2025-02-05 15:35:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:38,456 INFO L225 Difference]: With dead ends: 8986 [2025-02-05 15:35:38,457 INFO L226 Difference]: Without dead ends: 6237 [2025-02-05 15:35:38,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:35:38,471 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1861 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1936 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:38,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1936 Valid, 872 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:35:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6237 states. [2025-02-05 15:35:38,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6237 to 5998. [2025-02-05 15:35:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5998 states, 4550 states have (on average 1.6457142857142857) internal successors, (7488), 4774 states have internal predecessors, (7488), 1138 states have call successors, (1138), 241 states have call predecessors, (1138), 309 states have return successors, (1532), 1134 states have call predecessors, (1532), 1133 states have call successors, (1532) [2025-02-05 15:35:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5998 states to 5998 states and 10158 transitions. [2025-02-05 15:35:38,762 INFO L78 Accepts]: Start accepts. Automaton has 5998 states and 10158 transitions. Word has length 148 [2025-02-05 15:35:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:38,763 INFO L471 AbstractCegarLoop]: Abstraction has 5998 states and 10158 transitions. [2025-02-05 15:35:38,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:35:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 5998 states and 10158 transitions. [2025-02-05 15:35:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:35:38,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:38,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:38,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 15:35:38,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:38,970 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:38,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1435817697, now seen corresponding path program 1 times [2025-02-05 15:35:38,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:38,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439103877] [2025-02-05 15:35:38,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:38,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:38,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:35:38,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:35:38,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:38,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:35:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439103877] [2025-02-05 15:35:39,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439103877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56539196] [2025-02-05 15:35:39,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:39,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:39,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:39,189 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:35:39,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:35:39,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:35:39,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:35:39,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:39,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:39,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:35:39,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:35:39,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:39,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56539196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:39,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:39,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:35:39,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938761512] [2025-02-05 15:35:39,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:39,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:39,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:39,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:39,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:35:39,489 INFO L87 Difference]: Start difference. First operand 5998 states and 10158 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:35:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:40,854 INFO L93 Difference]: Finished difference Result 19694 states and 34386 transitions. [2025-02-05 15:35:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:40,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2025-02-05 15:35:40,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:40,928 INFO L225 Difference]: With dead ends: 19694 [2025-02-05 15:35:40,929 INFO L226 Difference]: Without dead ends: 13741 [2025-02-05 15:35:40,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:35:40,959 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1846 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1920 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:40,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1920 Valid, 869 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 15:35:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13741 states. [2025-02-05 15:35:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13741 to 13247. [2025-02-05 15:35:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13247 states, 9839 states have (on average 1.6365484297184674) internal successors, (16102), 10377 states have internal predecessors, (16102), 2758 states have call successors, (2758), 477 states have call predecessors, (2758), 649 states have return successors, (4182), 2774 states have call predecessors, (4182), 2753 states have call successors, (4182) [2025-02-05 15:35:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13247 states to 13247 states and 23042 transitions. [2025-02-05 15:35:41,687 INFO L78 Accepts]: Start accepts. Automaton has 13247 states and 23042 transitions. Word has length 149 [2025-02-05 15:35:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:41,688 INFO L471 AbstractCegarLoop]: Abstraction has 13247 states and 23042 transitions. [2025-02-05 15:35:41,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:35:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 13247 states and 23042 transitions. [2025-02-05 15:35:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:35:41,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:41,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:41,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 15:35:41,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-05 15:35:41,893 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:41,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1560861134, now seen corresponding path program 1 times [2025-02-05 15:35:41,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:41,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243922195] [2025-02-05 15:35:41,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:41,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:41,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:35:41,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:35:41,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:41,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:35:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243922195] [2025-02-05 15:35:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243922195] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981352828] [2025-02-05 15:35:42,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:42,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:42,069 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:35:42,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:35:42,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:35:42,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:35:42,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:42,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:42,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:35:42,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:35:42,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981352828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:42,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:42,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:35:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109047751] [2025-02-05 15:35:42,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:42,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:42,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:42,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:42,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:35:42,374 INFO L87 Difference]: Start difference. First operand 13247 states and 23042 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:35:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:44,937 INFO L93 Difference]: Finished difference Result 44259 states and 80925 transitions. [2025-02-05 15:35:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 150 [2025-02-05 15:35:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:45,215 INFO L225 Difference]: With dead ends: 44259 [2025-02-05 15:35:45,215 INFO L226 Difference]: Without dead ends: 31057 [2025-02-05 15:35:45,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:35:45,313 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 1834 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:45,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 863 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 15:35:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31057 states. [2025-02-05 15:35:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31057 to 30108. [2025-02-05 15:35:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30108 states, 21840 states have (on average 1.6241758241758242) internal successors, (35472), 23160 states have internal predecessors, (35472), 6886 states have call successors, (6886), 949 states have call predecessors, (6886), 1381 states have return successors, (12056), 6978 states have call predecessors, (12056), 6881 states have call successors, (12056) [2025-02-05 15:35:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30108 states to 30108 states and 54414 transitions. [2025-02-05 15:35:46,898 INFO L78 Accepts]: Start accepts. Automaton has 30108 states and 54414 transitions. Word has length 150 [2025-02-05 15:35:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:46,900 INFO L471 AbstractCegarLoop]: Abstraction has 30108 states and 54414 transitions. [2025-02-05 15:35:46,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:35:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 30108 states and 54414 transitions. [2025-02-05 15:35:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:35:46,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:46,906 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:46,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-05 15:35:47,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-05 15:35:47,107 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:47,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:47,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1142244167, now seen corresponding path program 1 times [2025-02-05 15:35:47,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:47,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649268269] [2025-02-05 15:35:47,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:47,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:47,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:35:47,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:35:47,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:47,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:35:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649268269] [2025-02-05 15:35:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649268269] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251559706] [2025-02-05 15:35:47,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:47,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:47,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:47,448 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:35:47,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:35:47,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:35:47,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:35:47,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:47,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:47,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:35:47,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:35:47,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:47,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251559706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:47,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:47,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:35:47,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484438069] [2025-02-05 15:35:47,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:47,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:47,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:47,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:47,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:35:47,757 INFO L87 Difference]: Start difference. First operand 30108 states and 54414 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:35:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:52,392 INFO L93 Difference]: Finished difference Result 102071 states and 200753 transitions. [2025-02-05 15:35:52,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:52,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2025-02-05 15:35:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:53,185 INFO L225 Difference]: With dead ends: 102071 [2025-02-05 15:35:53,185 INFO L226 Difference]: Without dead ends: 71998 [2025-02-05 15:35:53,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:35:53,324 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1809 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:53,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1881 Valid, 960 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 15:35:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71998 states. [2025-02-05 15:35:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71998 to 70391. [2025-02-05 15:35:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70391 states, 49807 states have (on average 1.6096532615897363) internal successors, (80172), 53101 states have internal predecessors, (80172), 17602 states have call successors, (17602), 1890 states have call predecessors, (17602), 2981 states have return successors, (36665), 17953 states have call predecessors, (36665), 17597 states have call successors, (36665) [2025-02-05 15:35:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70391 states to 70391 states and 134439 transitions. [2025-02-05 15:35:58,522 INFO L78 Accepts]: Start accepts. Automaton has 70391 states and 134439 transitions. Word has length 151 [2025-02-05 15:35:58,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:58,524 INFO L471 AbstractCegarLoop]: Abstraction has 70391 states and 134439 transitions. [2025-02-05 15:35:58,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:35:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 70391 states and 134439 transitions. [2025-02-05 15:35:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 15:35:58,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:58,545 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:58,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 15:35:58,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:58,750 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:58,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash -397875928, now seen corresponding path program 1 times [2025-02-05 15:35:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521373460] [2025-02-05 15:35:58,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:58,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 15:35:58,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 15:35:58,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:58,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 15:35:58,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:58,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521373460] [2025-02-05 15:35:58,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521373460] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:58,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162240866] [2025-02-05 15:35:58,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:58,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:58,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:58,969 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:35:58,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:35:59,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 15:35:59,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 15:35:59,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:59,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:59,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1895 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:35:59,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:35:59,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:59,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162240866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:59,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:59,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:35:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166880616] [2025-02-05 15:35:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:59,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:59,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:59,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:59,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:35:59,285 INFO L87 Difference]: Start difference. First operand 70391 states and 134439 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:36:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:03,750 INFO L93 Difference]: Finished difference Result 143616 states and 284152 transitions. [2025-02-05 15:36:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:03,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 199 [2025-02-05 15:36:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:04,376 INFO L225 Difference]: With dead ends: 143616 [2025-02-05 15:36:04,376 INFO L226 Difference]: Without dead ends: 73271 [2025-02-05 15:36:04,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:36:04,960 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 144 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:04,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2311 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73271 states. [2025-02-05 15:36:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73271 to 72887. [2025-02-05 15:36:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72887 states, 52239 states have (on average 1.624150538869427) internal successors, (84844), 55533 states have internal predecessors, (84844), 17602 states have call successors, (17602), 1954 states have call predecessors, (17602), 3045 states have return successors, (36665), 17953 states have call predecessors, (36665), 17597 states have call successors, (36665) [2025-02-05 15:36:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72887 states to 72887 states and 139111 transitions. [2025-02-05 15:36:09,577 INFO L78 Accepts]: Start accepts. Automaton has 72887 states and 139111 transitions. Word has length 199 [2025-02-05 15:36:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:09,577 INFO L471 AbstractCegarLoop]: Abstraction has 72887 states and 139111 transitions. [2025-02-05 15:36:09,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:36:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 72887 states and 139111 transitions. [2025-02-05 15:36:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 15:36:09,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:09,593 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:09,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-05 15:36:09,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:09,793 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:09,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:09,794 INFO L85 PathProgramCache]: Analyzing trace with hash 580128704, now seen corresponding path program 1 times [2025-02-05 15:36:09,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:09,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955454963] [2025-02-05 15:36:09,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:09,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 15:36:09,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 15:36:09,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:09,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 15:36:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955454963] [2025-02-05 15:36:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955454963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:09,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337531768] [2025-02-05 15:36:09,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:09,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:09,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:10,000 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:36:10,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 15:36:10,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 15:36:10,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 15:36:10,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:10,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:10,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 1900 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:36:10,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:36:10,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:10,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337531768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:10,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:10,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:36:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597379220] [2025-02-05 15:36:10,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:10,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:10,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:10,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:36:10,297 INFO L87 Difference]: Start difference. First operand 72887 states and 139111 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23)