./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product23.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product23.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3c1ff6fd56cd2377d464f2b10cb9a0da8b8728fdfad0102577329687d925f1d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:15:58,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:15:58,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:15:58,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:15:58,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:15:58,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:15:58,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:15:58,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:15:58,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:15:58,919 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:15:58,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:15:58,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:15:58,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:15:58,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:15:58,921 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:15:58,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:15:58,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:15:58,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:58,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:15:58,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:15:58,923 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/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 -> 3c1ff6fd56cd2377d464f2b10cb9a0da8b8728fdfad0102577329687d925f1d9 [2025-03-03 14:15:59,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:15:59,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:15:59,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:15:59,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:15:59,146 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:15:59,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product23.cil.c [2025-03-03 14:16:00,341 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6e48807/ad84193b21384eb6a76b894b10798838/FLAG2f472043e [2025-03-03 14:16:00,700 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:16:00,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product23.cil.c [2025-03-03 14:16:00,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6e48807/ad84193b21384eb6a76b894b10798838/FLAG2f472043e [2025-03-03 14:16:00,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6e48807/ad84193b21384eb6a76b894b10798838 [2025-03-03 14:16:00,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:16:00,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:16:00,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:16:00,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:16:00,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:16:00,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:16:00" (1/1) ... [2025-03-03 14:16:00,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3a61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:00, skipping insertion in model container [2025-03-03 14:16:00,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:16:00" (1/1) ... [2025-03-03 14:16:00,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:16:01,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product23.cil.c[35995,36008] [2025-03-03 14:16:01,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:16:01,147 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:16:01,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [48] [2025-03-03 14:16:01,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [235] [2025-03-03 14:16:01,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [273] [2025-03-03 14:16:01,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [941] [2025-03-03 14:16:01,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1307] [2025-03-03 14:16:01,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1665] [2025-03-03 14:16:01,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1674] [2025-03-03 14:16:01,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1766] [2025-03-03 14:16:01,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1778] [2025-03-03 14:16:01,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1898] [2025-03-03 14:16:01,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product23.cil.c[35995,36008] [2025-03-03 14:16:01,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:16:01,264 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:16:01,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01 WrapperNode [2025-03-03 14:16:01,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:16:01,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:16:01,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:16:01,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:16:01,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,317 INFO L138 Inliner]: procedures = 96, calls = 347, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 918 [2025-03-03 14:16:01,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:16:01,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:16:01,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:16:01,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:16:01,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,355 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-03-03 14:16:01,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:16:01,390 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:16:01,390 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:16:01,390 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:16:01,391 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (1/1) ... [2025-03-03 14:16:01,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:16:01,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:01,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:16:01,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:16:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:16:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:16:01,437 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:16:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:16:01,437 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:16:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:16:01,438 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:16:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:16:01,438 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:16:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:16:01,438 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:16:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:16:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:16:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:16:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:16:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:16:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:16:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:16:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:16:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:16:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:16:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:16:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:16:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:16:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:16:01,441 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:16:01,442 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:16:01,442 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:16:01,442 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:16:01,442 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:16:01,442 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:16:01,442 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:16:01,442 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:16:01,442 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:16:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:16:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:16:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:16:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:16:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:16:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:16:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:16:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:16:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:16:01,591 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:16:01,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:16:01,666 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2825-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~25#1; [2025-03-03 14:16:01,666 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2853: #res#1 := ~retValue_acc~26#1; [2025-03-03 14:16:01,691 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895: #res := ~retValue_acc~12; [2025-03-03 14:16:01,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1817: #res := ~retValue_acc~10; [2025-03-03 14:16:01,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1972: #res := ~retValue_acc~13; [2025-03-03 14:16:01,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: #res := ~retValue_acc~14; [2025-03-03 14:16:01,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3481: #res := ~retValue_acc~30; [2025-03-03 14:16:01,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~24#1; [2025-03-03 14:16:01,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2706-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~22#1; [2025-03-03 14:16:01,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735: #res#1 := ~retValue_acc~23#1; [2025-03-03 14:16:01,963 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2898: #res := ~retValue_acc~28; [2025-03-03 14:16:01,974 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1856: #res := ~retValue_acc~11; [2025-03-03 14:16:01,994 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2172: #res := ~retValue_acc~16; [2025-03-03 14:16:02,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2301-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-03 14:16:02,108 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2314-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-03 14:16:02,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1; [2025-03-03 14:16:02,278 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: #res := ~retValue_acc~3; [2025-03-03 14:16:02,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2666: #res := ~retValue_acc~21; [2025-03-03 14:16:02,430 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1662-1: main_#res#1 := main_~retValue_acc~9#1; [2025-03-03 14:16:02,431 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L270-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-03 14:16:02,439 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: #res := ~retValue_acc~2; [2025-03-03 14:16:02,441 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2138: #res := ~retValue_acc~15; [2025-03-03 14:16:02,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L938: #res := ~retValue_acc~4; [2025-03-03 14:16:02,556 INFO L? ?]: Removed 471 outVars from TransFormulas that were not future-live. [2025-03-03 14:16:02,556 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:16:02,574 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:16:02,574 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:16:02,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:16:02 BoogieIcfgContainer [2025-03-03 14:16:02,575 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:16:02,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:16:02,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:16:02,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:16:02,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:16:00" (1/3) ... [2025-03-03 14:16:02,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe9a0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:16:02, skipping insertion in model container [2025-03-03 14:16:02,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:01" (2/3) ... [2025-03-03 14:16:02,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe9a0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:16:02, skipping insertion in model container [2025-03-03 14:16:02,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:16:02" (3/3) ... [2025-03-03 14:16:02,585 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product23.cil.c [2025-03-03 14:16:02,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:16:02,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product23.cil.c that has 27 procedures, 586 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:16:02,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:16:02,695 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;@4f1201e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:16:02,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:16:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 586 states, 456 states have (on average 1.6776315789473684) internal successors, (765), 477 states have internal predecessors, (765), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 14:16:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:16:02,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 14:16:02,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:02,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1549958089, now seen corresponding path program 1 times [2025-03-03 14:16:02,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:02,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544159046] [2025-03-03 14:16:02,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:02,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:16:02,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:16:02,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:03,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:03,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544159046] [2025-03-03 14:16:03,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544159046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:03,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:03,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:03,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890494383] [2025-03-03 14:16:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:03,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:03,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:03,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:03,219 INFO L87 Difference]: Start difference. First operand has 586 states, 456 states have (on average 1.6776315789473684) internal successors, (765), 477 states have internal predecessors, (765), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:03,349 INFO L93 Difference]: Finished difference Result 1152 states and 1913 transitions. [2025-03-03 14:16:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:03,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2025-03-03 14:16:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:03,362 INFO L225 Difference]: With dead ends: 1152 [2025-03-03 14:16:03,362 INFO L226 Difference]: Without dead ends: 578 [2025-03-03 14:16:03,370 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-03-03 14:16:03,373 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 5 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2843 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-03-03 14:16:03,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2843 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-03 14:16:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-03-03 14:16:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 450 states have (on average 1.6755555555555555) internal successors, (754), 469 states have internal predecessors, (754), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 953 transitions. [2025-03-03 14:16:03,454 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 953 transitions. Word has length 104 [2025-03-03 14:16:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:03,454 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 953 transitions. [2025-03-03 14:16:03,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 953 transitions. [2025-03-03 14:16:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:16:03,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:03,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 14:16:03,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:16:03,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:03,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1574480683, now seen corresponding path program 1 times [2025-03-03 14:16:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238458059] [2025-03-03 14:16:03,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:03,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:16:03,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:16:03,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238458059] [2025-03-03 14:16:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238458059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:03,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:03,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:03,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24747811] [2025-03-03 14:16:03,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:03,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:03,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:03,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:03,656 INFO L87 Difference]: Start difference. First operand 578 states and 953 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:03,714 INFO L93 Difference]: Finished difference Result 1138 states and 1883 transitions. [2025-03-03 14:16:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:03,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2025-03-03 14:16:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:03,720 INFO L225 Difference]: With dead ends: 1138 [2025-03-03 14:16:03,720 INFO L226 Difference]: Without dead ends: 578 [2025-03-03 14:16:03,722 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-03-03 14:16:03,723 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 4 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2822 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-03-03 14:16:03,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2822 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-03 14:16:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-03-03 14:16:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 450 states have (on average 1.6733333333333333) internal successors, (753), 469 states have internal predecessors, (753), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 952 transitions. [2025-03-03 14:16:03,756 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 952 transitions. Word has length 107 [2025-03-03 14:16:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:03,756 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 952 transitions. [2025-03-03 14:16:03,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 952 transitions. [2025-03-03 14:16:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:16:03,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:03,762 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 14:16:03,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:16:03,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:03,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1485033615, now seen corresponding path program 1 times [2025-03-03 14:16:03,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:03,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767148069] [2025-03-03 14:16:03,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:03,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:16:03,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:16:03,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:03,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:03,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767148069] [2025-03-03 14:16:03,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767148069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:03,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:03,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:03,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487686242] [2025-03-03 14:16:03,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:03,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:03,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:03,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:03,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:03,923 INFO L87 Difference]: Start difference. First operand 578 states and 952 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:03,979 INFO L93 Difference]: Finished difference Result 1138 states and 1882 transitions. [2025-03-03 14:16:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2025-03-03 14:16:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:03,986 INFO L225 Difference]: With dead ends: 1138 [2025-03-03 14:16:03,986 INFO L226 Difference]: Without dead ends: 578 [2025-03-03 14:16:03,989 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-03-03 14:16:03,991 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 3 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2822 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-03-03 14:16:03,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2822 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-03 14:16:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-03-03 14:16:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 450 states have (on average 1.6711111111111112) internal successors, (752), 469 states have internal predecessors, (752), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 951 transitions. [2025-03-03 14:16:04,016 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 951 transitions. Word has length 108 [2025-03-03 14:16:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:04,016 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 951 transitions. [2025-03-03 14:16:04,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 951 transitions. [2025-03-03 14:16:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:16:04,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:04,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 14:16:04,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:16:04,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:04,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:04,023 INFO L85 PathProgramCache]: Analyzing trace with hash -873047182, now seen corresponding path program 1 times [2025-03-03 14:16:04,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:04,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075652908] [2025-03-03 14:16:04,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:04,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:16:04,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:16:04,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075652908] [2025-03-03 14:16:04,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075652908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:04,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:04,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:04,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861537596] [2025-03-03 14:16:04,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:04,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:04,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:04,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:04,166 INFO L87 Difference]: Start difference. First operand 578 states and 951 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:04,211 INFO L93 Difference]: Finished difference Result 1138 states and 1881 transitions. [2025-03-03 14:16:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:04,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-03-03 14:16:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:04,216 INFO L225 Difference]: With dead ends: 1138 [2025-03-03 14:16:04,217 INFO L226 Difference]: Without dead ends: 578 [2025-03-03 14:16:04,219 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-03-03 14:16:04,221 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 2 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2822 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-03-03 14:16:04,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2822 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-03 14:16:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-03-03 14:16:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 450 states have (on average 1.6688888888888889) internal successors, (751), 469 states have internal predecessors, (751), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 950 transitions. [2025-03-03 14:16:04,256 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 950 transitions. Word has length 109 [2025-03-03 14:16:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:04,256 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 950 transitions. [2025-03-03 14:16:04,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 950 transitions. [2025-03-03 14:16:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:16:04,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:04,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 14:16:04,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:16:04,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:04,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:04,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1242209618, now seen corresponding path program 1 times [2025-03-03 14:16:04,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:04,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882144279] [2025-03-03 14:16:04,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:04,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:16:04,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:16:04,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:04,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:04,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882144279] [2025-03-03 14:16:04,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882144279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:04,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:04,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640123786] [2025-03-03 14:16:04,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:04,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:04,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:04,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:04,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:04,420 INFO L87 Difference]: Start difference. First operand 578 states and 950 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:04,459 INFO L93 Difference]: Finished difference Result 1138 states and 1880 transitions. [2025-03-03 14:16:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2025-03-03 14:16:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:04,464 INFO L225 Difference]: With dead ends: 1138 [2025-03-03 14:16:04,465 INFO L226 Difference]: Without dead ends: 578 [2025-03-03 14:16:04,467 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-03-03 14:16:04,468 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 1 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2822 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-03-03 14:16:04,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2822 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-03 14:16:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-03-03 14:16:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 450 states have (on average 1.6666666666666667) internal successors, (750), 469 states have internal predecessors, (750), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 949 transitions. [2025-03-03 14:16:04,489 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 949 transitions. Word has length 110 [2025-03-03 14:16:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:04,489 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 949 transitions. [2025-03-03 14:16:04,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 949 transitions. [2025-03-03 14:16:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:16:04,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:04,493 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:04,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:16:04,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:04,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1962215921, now seen corresponding path program 1 times [2025-03-03 14:16:04,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:04,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742303008] [2025-03-03 14:16:04,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:04,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:16:04,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:16:04,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:04,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:04,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742303008] [2025-03-03 14:16:04,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742303008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:04,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:04,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:16:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378077501] [2025-03-03 14:16:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:16:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:04,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:16:04,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:04,730 INFO L87 Difference]: Start difference. First operand 578 states and 949 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:16:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:04,853 INFO L93 Difference]: Finished difference Result 1104 states and 1812 transitions. [2025-03-03 14:16:04,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:16:04,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-03-03 14:16:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:04,859 INFO L225 Difference]: With dead ends: 1104 [2025-03-03 14:16:04,860 INFO L226 Difference]: Without dead ends: 593 [2025-03-03 14:16:04,862 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-03-03 14:16:04,863 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 91 mSDsluCounter, 6476 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7413 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-03-03 14:16:04,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7413 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-03 14:16:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2025-03-03 14:16:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.6630434782608696) internal successors, (765), 481 states have internal predecessors, (765), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2025-03-03 14:16:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 968 transitions. [2025-03-03 14:16:04,895 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 968 transitions. Word has length 111 [2025-03-03 14:16:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:04,896 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 968 transitions. [2025-03-03 14:16:04,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:16:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 968 transitions. [2025-03-03 14:16:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:16:04,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:04,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:04,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:16:04,902 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:04,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:04,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263918, now seen corresponding path program 1 times [2025-03-03 14:16:04,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:04,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040425396] [2025-03-03 14:16:04,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:04,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:16:04,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:16:04,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:04,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:04,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040425396] [2025-03-03 14:16:04,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040425396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:04,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:04,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:04,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617255192] [2025-03-03 14:16:04,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:04,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:04,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:04,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:04,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:04,997 INFO L87 Difference]: Start difference. First operand 591 states and 968 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:05,029 INFO L93 Difference]: Finished difference Result 1156 states and 1906 transitions. [2025-03-03 14:16:05,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:05,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-03-03 14:16:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:05,033 INFO L225 Difference]: With dead ends: 1156 [2025-03-03 14:16:05,033 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:16:05,035 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-03-03 14:16:05,036 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 0 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2824 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-03-03 14:16:05,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2824 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:16:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:16:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 444 states have (on average 1.6576576576576576) internal successors, (736), 463 states have internal predecessors, (736), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 935 transitions. [2025-03-03 14:16:05,052 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 935 transitions. Word has length 111 [2025-03-03 14:16:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:05,052 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 935 transitions. [2025-03-03 14:16:05,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 935 transitions. [2025-03-03 14:16:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:16:05,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:05,055 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:05,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:16:05,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:05,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1844418322, now seen corresponding path program 1 times [2025-03-03 14:16:05,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:05,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640549980] [2025-03-03 14:16:05,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:05,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:05,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:16:05,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:16:05,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:05,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:05,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:05,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640549980] [2025-03-03 14:16:05,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640549980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:05,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:05,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:05,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401538899] [2025-03-03 14:16:05,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:05,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:05,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:05,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:05,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:05,171 INFO L87 Difference]: Start difference. First operand 572 states and 935 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:05,330 INFO L93 Difference]: Finished difference Result 1101 states and 1804 transitions. [2025-03-03 14:16:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:05,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2025-03-03 14:16:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:05,335 INFO L225 Difference]: With dead ends: 1101 [2025-03-03 14:16:05,336 INFO L226 Difference]: Without dead ends: 581 [2025-03-03 14:16:05,338 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-03-03 14:16:05,339 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 55 mSDsluCounter, 3539 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4431 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-03-03 14:16:05,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4431 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-03 14:16:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 572. [2025-03-03 14:16:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 444 states have (on average 1.6486486486486487) internal successors, (732), 463 states have internal predecessors, (732), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 931 transitions. [2025-03-03 14:16:05,360 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 931 transitions. Word has length 112 [2025-03-03 14:16:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:05,360 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 931 transitions. [2025-03-03 14:16:05,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 931 transitions. [2025-03-03 14:16:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:16:05,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:05,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:05,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:16:05,365 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:05,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1267497158, now seen corresponding path program 1 times [2025-03-03 14:16:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:05,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377744744] [2025-03-03 14:16:05,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:05,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:05,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:16:05,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:16:05,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:05,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:05,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:05,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377744744] [2025-03-03 14:16:05,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377744744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:05,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032755734] [2025-03-03 14:16:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:05,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:05,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:05,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:05,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:05,494 INFO L87 Difference]: Start difference. First operand 572 states and 931 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:05,655 INFO L93 Difference]: Finished difference Result 1101 states and 1800 transitions. [2025-03-03 14:16:05,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:05,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2025-03-03 14:16:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:05,659 INFO L225 Difference]: With dead ends: 1101 [2025-03-03 14:16:05,659 INFO L226 Difference]: Without dead ends: 581 [2025-03-03 14:16:05,661 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-03-03 14:16:05,661 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 54 mSDsluCounter, 3539 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4431 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-03-03 14:16:05,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4431 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-03 14:16:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 572. [2025-03-03 14:16:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 444 states have (on average 1.6396396396396395) internal successors, (728), 463 states have internal predecessors, (728), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 927 transitions. [2025-03-03 14:16:05,678 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 927 transitions. Word has length 113 [2025-03-03 14:16:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:05,679 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 927 transitions. [2025-03-03 14:16:05,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 927 transitions. [2025-03-03 14:16:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:16:05,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:05,682 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:05,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:16:05,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:05,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:05,683 INFO L85 PathProgramCache]: Analyzing trace with hash -883117803, now seen corresponding path program 1 times [2025-03-03 14:16:05,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:05,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050205223] [2025-03-03 14:16:05,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:05,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:05,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:16:05,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:16:05,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:05,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:05,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:05,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050205223] [2025-03-03 14:16:05,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050205223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:05,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:05,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:05,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671884169] [2025-03-03 14:16:05,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:05,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:05,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:05,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:05,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:05,798 INFO L87 Difference]: Start difference. First operand 572 states and 927 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:05,930 INFO L93 Difference]: Finished difference Result 1101 states and 1796 transitions. [2025-03-03 14:16:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2025-03-03 14:16:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:05,935 INFO L225 Difference]: With dead ends: 1101 [2025-03-03 14:16:05,935 INFO L226 Difference]: Without dead ends: 581 [2025-03-03 14:16:05,937 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-03-03 14:16:05,937 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 53 mSDsluCounter, 3522 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4413 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-03-03 14:16:05,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4413 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-03 14:16:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 572. [2025-03-03 14:16:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 444 states have (on average 1.6306306306306306) internal successors, (724), 463 states have internal predecessors, (724), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 923 transitions. [2025-03-03 14:16:05,953 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 923 transitions. Word has length 114 [2025-03-03 14:16:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:05,953 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 923 transitions. [2025-03-03 14:16:05,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 923 transitions. [2025-03-03 14:16:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:16:05,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:05,956 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:05,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:16:05,956 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:05,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1240904452, now seen corresponding path program 1 times [2025-03-03 14:16:05,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:05,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103377521] [2025-03-03 14:16:05,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:05,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:16:05,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:16:05,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:05,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:06,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:06,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103377521] [2025-03-03 14:16:06,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103377521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:06,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:06,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680294893] [2025-03-03 14:16:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:06,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:06,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:06,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:06,080 INFO L87 Difference]: Start difference. First operand 572 states and 923 transitions. Second operand has 7 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:16:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:06,135 INFO L93 Difference]: Finished difference Result 1092 states and 1778 transitions. [2025-03-03 14:16:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:06,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-03-03 14:16:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:06,139 INFO L225 Difference]: With dead ends: 1092 [2025-03-03 14:16:06,140 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:16:06,142 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-03-03 14:16:06,142 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 84 mSDsluCounter, 4487 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5399 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-03-03 14:16:06,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5399 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:16:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:16:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 423 states have (on average 1.6312056737588652) internal successors, (690), 442 states have internal predecessors, (690), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 889 transitions. [2025-03-03 14:16:06,158 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 889 transitions. Word has length 114 [2025-03-03 14:16:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:06,158 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 889 transitions. [2025-03-03 14:16:06,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:16:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 889 transitions. [2025-03-03 14:16:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:16:06,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:06,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:06,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:16:06,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:06,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash -278632919, now seen corresponding path program 1 times [2025-03-03 14:16:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082372464] [2025-03-03 14:16:06,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:06,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:16:06,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:16:06,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:06,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:06,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:06,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082372464] [2025-03-03 14:16:06,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082372464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:06,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:06,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255969409] [2025-03-03 14:16:06,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:06,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:06,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:06,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:06,291 INFO L87 Difference]: Start difference. First operand 551 states and 889 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:06,352 INFO L93 Difference]: Finished difference Result 1071 states and 1744 transitions. [2025-03-03 14:16:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:06,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-03-03 14:16:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:06,357 INFO L225 Difference]: With dead ends: 1071 [2025-03-03 14:16:06,357 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:16:06,359 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-03-03 14:16:06,360 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 17 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4351 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-03-03 14:16:06,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4351 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:16:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:16:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 423 states have (on average 1.6288416075650118) internal successors, (689), 442 states have internal predecessors, (689), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 888 transitions. [2025-03-03 14:16:06,375 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 888 transitions. Word has length 115 [2025-03-03 14:16:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:06,375 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 888 transitions. [2025-03-03 14:16:06,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 888 transitions. [2025-03-03 14:16:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:16:06,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:06,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:06,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:16:06,379 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:06,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:06,379 INFO L85 PathProgramCache]: Analyzing trace with hash -165398760, now seen corresponding path program 1 times [2025-03-03 14:16:06,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:06,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133908317] [2025-03-03 14:16:06,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:06,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:16:06,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:16:06,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:06,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:06,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133908317] [2025-03-03 14:16:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133908317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:06,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:06,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:06,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437419434] [2025-03-03 14:16:06,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:06,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:06,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:06,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:06,489 INFO L87 Difference]: Start difference. First operand 551 states and 888 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:06,546 INFO L93 Difference]: Finished difference Result 1071 states and 1743 transitions. [2025-03-03 14:16:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:06,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2025-03-03 14:16:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:06,550 INFO L225 Difference]: With dead ends: 1071 [2025-03-03 14:16:06,550 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:16:06,552 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-03-03 14:16:06,553 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 16 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4351 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-03-03 14:16:06,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4351 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:16:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:16:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 423 states have (on average 1.6264775413711583) internal successors, (688), 442 states have internal predecessors, (688), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 887 transitions. [2025-03-03 14:16:06,568 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 887 transitions. Word has length 116 [2025-03-03 14:16:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:06,569 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 887 transitions. [2025-03-03 14:16:06,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 887 transitions. [2025-03-03 14:16:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:16:06,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:06,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:06,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:16:06,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1898932108, now seen corresponding path program 1 times [2025-03-03 14:16:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:06,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30103559] [2025-03-03 14:16:06,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:06,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:16:06,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:16:06,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:06,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:16:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30103559] [2025-03-03 14:16:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30103559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:16:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208470985] [2025-03-03 14:16:06,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:06,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:16:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:06,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:16:06,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:06,770 INFO L87 Difference]: Start difference. First operand 551 states and 887 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:16:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:06,857 INFO L93 Difference]: Finished difference Result 1065 states and 1731 transitions. [2025-03-03 14:16:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:16:06,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2025-03-03 14:16:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:06,861 INFO L225 Difference]: With dead ends: 1065 [2025-03-03 14:16:06,862 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:16:06,863 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-03-03 14:16:06,864 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 6 mSDsluCounter, 6946 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7817 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-03-03 14:16:06,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7817 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:16:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:16:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 423 states have (on average 1.624113475177305) internal successors, (687), 442 states have internal predecessors, (687), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:16:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 886 transitions. [2025-03-03 14:16:06,880 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 886 transitions. Word has length 117 [2025-03-03 14:16:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:06,881 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 886 transitions. [2025-03-03 14:16:06,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:16:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 886 transitions. [2025-03-03 14:16:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:16:06,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:06,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:06,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:16:06,884 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:06,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:06,885 INFO L85 PathProgramCache]: Analyzing trace with hash -582683317, now seen corresponding path program 1 times [2025-03-03 14:16:06,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:06,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203388337] [2025-03-03 14:16:06,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:06,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:16:06,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:16:06,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:06,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:16:06,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203388337] [2025-03-03 14:16:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203388337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252853287] [2025-03-03 14:16:06,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:06,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:06,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:06,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:16:07,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:16:07,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:16:07,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:07,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:07,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:07,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:16:07,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:07,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252853287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:07,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:07,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:07,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008984297] [2025-03-03 14:16:07,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:07,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:07,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:07,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:07,400 INFO L87 Difference]: Start difference. First operand 551 states and 886 transitions. Second operand has 5 states, 5 states have (on average 16.6) 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-03-03 14:16:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:07,864 INFO L93 Difference]: Finished difference Result 1065 states and 1756 transitions. [2025-03-03 14:16:07,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:07,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) 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 118 [2025-03-03 14:16:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:07,868 INFO L225 Difference]: With dead ends: 1065 [2025-03-03 14:16:07,868 INFO L226 Difference]: Without dead ends: 559 [2025-03-03 14:16:07,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 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-03-03 14:16:07,871 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 849 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:07,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 2212 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:16:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-03 14:16:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-03 14:16:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 430 states have (on average 1.6255813953488372) internal successors, (699), 449 states have internal predecessors, (699), 102 states have call successors, (102), 27 states have call predecessors, (102), 26 states have return successors, (98), 95 states have call predecessors, (98), 97 states have call successors, (98) [2025-03-03 14:16:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 899 transitions. [2025-03-03 14:16:07,889 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 899 transitions. Word has length 118 [2025-03-03 14:16:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:07,889 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 899 transitions. [2025-03-03 14:16:07,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) 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-03-03 14:16:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 899 transitions. [2025-03-03 14:16:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:16:07,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:07,892 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] [2025-03-03 14:16:07,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:16:08,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:16:08,096 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:08,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash 783464197, now seen corresponding path program 1 times [2025-03-03 14:16:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:08,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25020611] [2025-03-03 14:16:08,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:08,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:16:08,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:16:08,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:08,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:16:08,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25020611] [2025-03-03 14:16:08,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25020611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692864476] [2025-03-03 14:16:08,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:08,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:08,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:08,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:08,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:16:08,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:16:08,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:16:08,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:08,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:08,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:08,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:16:08,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:08,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692864476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:08,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:08,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:08,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567120814] [2025-03-03 14:16:08,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:08,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:08,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:08,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:08,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:08,611 INFO L87 Difference]: Start difference. First operand 559 states and 899 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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-03-03 14:16:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:09,047 INFO L93 Difference]: Finished difference Result 1081 states and 1779 transitions. [2025-03-03 14:16:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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-03-03 14:16:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:09,051 INFO L225 Difference]: With dead ends: 1081 [2025-03-03 14:16:09,051 INFO L226 Difference]: Without dead ends: 567 [2025-03-03 14:16:09,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 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-03-03 14:16:09,055 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 843 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:09,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 2209 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:16:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-03 14:16:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-03-03 14:16:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 437 states have (on average 1.6270022883295194) internal successors, (711), 456 states have internal predecessors, (711), 102 states have call successors, (102), 28 states have call predecessors, (102), 27 states have return successors, (99), 95 states have call predecessors, (99), 97 states have call successors, (99) [2025-03-03 14:16:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 912 transitions. [2025-03-03 14:16:09,075 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 912 transitions. Word has length 120 [2025-03-03 14:16:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:09,076 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 912 transitions. [2025-03-03 14:16:09,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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-03-03 14:16:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 912 transitions. [2025-03-03 14:16:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:16:09,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:09,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:09,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:09,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:16:09,279 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:09,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:09,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1574493675, now seen corresponding path program 1 times [2025-03-03 14:16:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:09,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504272106] [2025-03-03 14:16:09,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:09,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:16:09,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:16:09,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:09,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:16:09,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:09,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504272106] [2025-03-03 14:16:09,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504272106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:09,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411581420] [2025-03-03 14:16:09,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:09,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:09,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:09,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:09,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:16:09,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:16:09,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:16:09,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:09,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:09,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:09,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:16:09,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411581420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:09,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714907795] [2025-03-03 14:16:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:09,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:09,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:09,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:09,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:09,722 INFO L87 Difference]: Start difference. First operand 567 states and 912 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 14:16:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:10,133 INFO L93 Difference]: Finished difference Result 1097 states and 1802 transitions. [2025-03-03 14:16:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:10,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 14:16:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:10,137 INFO L225 Difference]: With dead ends: 1097 [2025-03-03 14:16:10,137 INFO L226 Difference]: Without dead ends: 575 [2025-03-03 14:16:10,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 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-03-03 14:16:10,141 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 824 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:10,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 2206 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:16:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-03 14:16:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2025-03-03 14:16:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 444 states have (on average 1.6283783783783783) internal successors, (723), 463 states have internal predecessors, (723), 102 states have call successors, (102), 29 states have call predecessors, (102), 28 states have return successors, (100), 95 states have call predecessors, (100), 97 states have call successors, (100) [2025-03-03 14:16:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 925 transitions. [2025-03-03 14:16:10,161 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 925 transitions. Word has length 122 [2025-03-03 14:16:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:10,161 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 925 transitions. [2025-03-03 14:16:10,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 14:16:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 925 transitions. [2025-03-03 14:16:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:16:10,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:10,163 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] [2025-03-03 14:16:10,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:10,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:10,364 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:10,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash 255532863, now seen corresponding path program 1 times [2025-03-03 14:16:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:10,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28865623] [2025-03-03 14:16:10,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:10,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:16:10,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:16:10,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:10,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:16:10,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:10,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28865623] [2025-03-03 14:16:10,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28865623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:10,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146015851] [2025-03-03 14:16:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:10,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:10,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:10,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:10,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:16:10,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:16:10,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:16:10,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:10,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:10,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:10,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:16:10,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:10,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146015851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:10,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:10,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:10,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261443843] [2025-03-03 14:16:10,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:10,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:10,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:10,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:10,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:10,785 INFO L87 Difference]: Start difference. First operand 575 states and 925 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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-03-03 14:16:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:11,173 INFO L93 Difference]: Finished difference Result 1113 states and 1825 transitions. [2025-03-03 14:16:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:11,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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-03-03 14:16:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:11,177 INFO L225 Difference]: With dead ends: 1113 [2025-03-03 14:16:11,177 INFO L226 Difference]: Without dead ends: 583 [2025-03-03 14:16:11,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 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-03-03 14:16:11,179 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 831 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:11,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 2203 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:16:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-03 14:16:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2025-03-03 14:16:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 451 states have (on average 1.629711751662971) internal successors, (735), 470 states have internal predecessors, (735), 102 states have call successors, (102), 30 states have call predecessors, (102), 29 states have return successors, (101), 95 states have call predecessors, (101), 97 states have call successors, (101) [2025-03-03 14:16:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 938 transitions. [2025-03-03 14:16:11,195 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 938 transitions. Word has length 124 [2025-03-03 14:16:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:11,195 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 938 transitions. [2025-03-03 14:16:11,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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-03-03 14:16:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 938 transitions. [2025-03-03 14:16:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:16:11,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:11,197 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] [2025-03-03 14:16:11,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:11,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 14:16:11,401 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:11,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash 9672907, now seen corresponding path program 1 times [2025-03-03 14:16:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:11,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806915711] [2025-03-03 14:16:11,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:11,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:16:11,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:16:11,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:11,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:16:11,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:11,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806915711] [2025-03-03 14:16:11,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806915711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:11,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613772970] [2025-03-03 14:16:11,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:11,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:11,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:11,482 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:11,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:16:11,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:16:11,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:16:11,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:11,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:11,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:11,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:16:11,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:11,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613772970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:11,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:11,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:11,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486814967] [2025-03-03 14:16:11,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:11,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:11,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:11,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:11,866 INFO L87 Difference]: Start difference. First operand 583 states and 938 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:16:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:12,132 INFO L93 Difference]: Finished difference Result 631 states and 1009 transitions. [2025-03-03 14:16:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:12,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 126 [2025-03-03 14:16:12,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:12,137 INFO L225 Difference]: With dead ends: 631 [2025-03-03 14:16:12,137 INFO L226 Difference]: Without dead ends: 616 [2025-03-03 14:16:12,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:12,137 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 820 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:12,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1590 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:16:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-03 14:16:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 586. [2025-03-03 14:16:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 454 states have (on average 1.6255506607929515) internal successors, (738), 473 states have internal predecessors, (738), 102 states have call successors, (102), 30 states have call predecessors, (102), 29 states have return successors, (101), 95 states have call predecessors, (101), 97 states have call successors, (101) [2025-03-03 14:16:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 941 transitions. [2025-03-03 14:16:12,160 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 941 transitions. Word has length 126 [2025-03-03 14:16:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:12,160 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 941 transitions. [2025-03-03 14:16:12,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:16:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 941 transitions. [2025-03-03 14:16:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:16:12,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:12,164 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] [2025-03-03 14:16:12,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:12,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:12,364 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:12,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1270713609, now seen corresponding path program 1 times [2025-03-03 14:16:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:12,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050146684] [2025-03-03 14:16:12,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:12,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:12,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:16:12,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:16:12,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:12,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:16:12,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:12,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050146684] [2025-03-03 14:16:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050146684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:12,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165687532] [2025-03-03 14:16:12,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:12,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:12,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:12,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:12,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:16:12,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:16:12,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:16:12,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:12,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:12,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:16:12,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:16:12,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165687532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:12,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:12,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-03 14:16:12,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577737698] [2025-03-03 14:16:12,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:12,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:12,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:12,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:12,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:12,703 INFO L87 Difference]: Start difference. First operand 586 states and 941 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 14:16:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:12,721 INFO L93 Difference]: Finished difference Result 601 states and 959 transitions. [2025-03-03 14:16:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:12,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2025-03-03 14:16:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:12,724 INFO L225 Difference]: With dead ends: 601 [2025-03-03 14:16:12,724 INFO L226 Difference]: Without dead ends: 586 [2025-03-03 14:16:12,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:12,727 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 0 mSDsluCounter, 2645 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3528 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:12,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3528 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-03 14:16:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-03-03 14:16:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 454 states have (on average 1.6233480176211454) internal successors, (737), 473 states have internal predecessors, (737), 102 states have call successors, (102), 30 states have call predecessors, (102), 29 states have return successors, (101), 95 states have call predecessors, (101), 97 states have call successors, (101) [2025-03-03 14:16:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 940 transitions. [2025-03-03 14:16:12,746 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 940 transitions. Word has length 132 [2025-03-03 14:16:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:12,746 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 940 transitions. [2025-03-03 14:16:12,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 14:16:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 940 transitions. [2025-03-03 14:16:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 14:16:12,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:12,749 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-03-03 14:16:12,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:12,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:12,954 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:12,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:12,954 INFO L85 PathProgramCache]: Analyzing trace with hash 655438794, now seen corresponding path program 1 times [2025-03-03 14:16:12,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:12,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840112583] [2025-03-03 14:16:12,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:12,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:12,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:16:12,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:16:12,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:12,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:16:13,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:13,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840112583] [2025-03-03 14:16:13,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840112583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:13,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491455387] [2025-03-03 14:16:13,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:13,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:13,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:13,061 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:13,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:16:13,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:16:13,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:16:13,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:13,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:13,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:16:13,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:16:13,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491455387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:13,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:13,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 14:16:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574675585] [2025-03-03 14:16:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:13,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:13,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:13,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:13,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:13,358 INFO L87 Difference]: Start difference. First operand 586 states and 940 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:16:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:13,701 INFO L93 Difference]: Finished difference Result 1129 states and 1856 transitions. [2025-03-03 14:16:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:13,701 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-03-03 14:16:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:13,704 INFO L225 Difference]: With dead ends: 1129 [2025-03-03 14:16:13,705 INFO L226 Difference]: Without dead ends: 588 [2025-03-03 14:16:13,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:13,707 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 826 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:13,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 2200 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:16:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-03 14:16:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2025-03-03 14:16:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 455 states have (on average 1.6131868131868132) internal successors, (734), 475 states have internal predecessors, (734), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 95 states have call predecessors, (102), 97 states have call successors, (102) [2025-03-03 14:16:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 938 transitions. [2025-03-03 14:16:13,723 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 938 transitions. Word has length 142 [2025-03-03 14:16:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:13,723 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 938 transitions. [2025-03-03 14:16:13,723 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:16:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 938 transitions. [2025-03-03 14:16:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 14:16:13,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:13,726 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-03-03 14:16:13,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:13,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:13,926 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:13,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1949571062, now seen corresponding path program 1 times [2025-03-03 14:16:13,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:13,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336244870] [2025-03-03 14:16:13,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:13,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:16:13,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:16:13,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:13,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:14,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:14,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336244870] [2025-03-03 14:16:14,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336244870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:14,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554577115] [2025-03-03 14:16:14,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:14,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:14,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:14,132 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:14,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:16:14,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:16:14,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:16:14,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:14,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:14,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 1500 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 14:16:14,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:14,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:14,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554577115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:14,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:14,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-03-03 14:16:14,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485600072] [2025-03-03 14:16:14,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:14,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:14,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:14,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:16:14,482 INFO L87 Difference]: Start difference. First operand 588 states and 938 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-03-03 14:16:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:16,399 INFO L93 Difference]: Finished difference Result 1857 states and 3030 transitions. [2025-03-03 14:16:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:16:16,400 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-03-03 14:16:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:16,406 INFO L225 Difference]: With dead ends: 1857 [2025-03-03 14:16:16,406 INFO L226 Difference]: Without dead ends: 1314 [2025-03-03 14:16:16,408 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-03-03 14:16:16,409 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 2170 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 3498 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 4001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:16,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 2034 Invalid, 4001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3498 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:16:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-03 14:16:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1226. [2025-03-03 14:16:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 948 states have (on average 1.6244725738396624) internal successors, (1540), 987 states have internal predecessors, (1540), 212 states have call successors, (212), 58 states have call predecessors, (212), 65 states have return successors, (240), 205 states have call predecessors, (240), 207 states have call successors, (240) [2025-03-03 14:16:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1992 transitions. [2025-03-03 14:16:16,458 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1992 transitions. Word has length 142 [2025-03-03 14:16:16,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:16,458 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1992 transitions. [2025-03-03 14:16:16,458 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-03-03 14:16:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1992 transitions. [2025-03-03 14:16:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:16:16,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:16,461 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-03-03 14:16:16,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:16,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 14:16:16,662 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:16,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:16,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1955575654, now seen corresponding path program 1 times [2025-03-03 14:16:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:16,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297475179] [2025-03-03 14:16:16,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:16,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:16,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:16,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:16,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:16,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:16,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:16,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297475179] [2025-03-03 14:16:16,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297475179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:16,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644867984] [2025-03-03 14:16:16,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:16,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:16,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:16,840 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:16,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:16:16,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:17,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:17,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:17,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:17,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:16:17,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:16:17,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:17,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644867984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:17,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:17,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-03-03 14:16:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222052620] [2025-03-03 14:16:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:17,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:16:17,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:17,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:16:17,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:16:17,079 INFO L87 Difference]: Start difference. First operand 1226 states and 1992 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-03-03 14:16:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:17,176 INFO L93 Difference]: Finished difference Result 2968 states and 4877 transitions. [2025-03-03 14:16:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:16:17,177 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-03-03 14:16:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:17,186 INFO L225 Difference]: With dead ends: 2968 [2025-03-03 14:16:17,186 INFO L226 Difference]: Without dead ends: 1791 [2025-03-03 14:16:17,190 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-03-03 14:16:17,190 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 825 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2457 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-03-03 14:16:17,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2457 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2025-03-03 14:16:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1224. [2025-03-03 14:16:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 947 states have (on average 1.6240760295670538) internal successors, (1538), 985 states have internal predecessors, (1538), 212 states have call successors, (212), 58 states have call predecessors, (212), 64 states have return successors, (234), 205 states have call predecessors, (234), 207 states have call successors, (234) [2025-03-03 14:16:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1984 transitions. [2025-03-03 14:16:17,240 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1984 transitions. Word has length 147 [2025-03-03 14:16:17,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:17,240 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1984 transitions. [2025-03-03 14:16:17,240 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-03-03 14:16:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1984 transitions. [2025-03-03 14:16:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:16:17,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:17,243 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-03-03 14:16:17,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:17,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:17,446 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:17,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1506879015, now seen corresponding path program 1 times [2025-03-03 14:16:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:17,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908344225] [2025-03-03 14:16:17,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:17,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:17,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:17,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:17,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908344225] [2025-03-03 14:16:17,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908344225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676442435] [2025-03-03 14:16:17,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:17,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:17,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:17,627 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:17,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:16:17,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:17,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:17,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:17,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:17,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:17,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:17,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:17,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676442435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:17,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:17,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253083609] [2025-03-03 14:16:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:17,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:17,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:17,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:17,947 INFO L87 Difference]: Start difference. First operand 1224 states and 1984 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-03-03 14:16:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:19,177 INFO L93 Difference]: Finished difference Result 3846 states and 6363 transitions. [2025-03-03 14:16:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:19,178 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-03-03 14:16:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:19,195 INFO L225 Difference]: With dead ends: 3846 [2025-03-03 14:16:19,195 INFO L226 Difference]: Without dead ends: 2667 [2025-03-03 14:16:19,201 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-03-03 14:16:19,202 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1952 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2036 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:19,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2036 Valid, 916 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:16:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2025-03-03 14:16:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2578. [2025-03-03 14:16:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 1966 states have (on average 1.6281790437436419) internal successors, (3201), 2053 states have internal predecessors, (3201), 479 states have call successors, (479), 111 states have call predecessors, (479), 132 states have return successors, (580), 473 states have call predecessors, (580), 474 states have call successors, (580) [2025-03-03 14:16:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 4260 transitions. [2025-03-03 14:16:19,326 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 4260 transitions. Word has length 147 [2025-03-03 14:16:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:19,326 INFO L471 AbstractCegarLoop]: Abstraction has 2578 states and 4260 transitions. [2025-03-03 14:16:19,327 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-03-03 14:16:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 4260 transitions. [2025-03-03 14:16:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:16:19,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:19,331 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-03-03 14:16:19,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 14:16:19,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 14:16:19,532 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:19,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash -531583584, now seen corresponding path program 1 times [2025-03-03 14:16:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:19,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098156997] [2025-03-03 14:16:19,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:19,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:19,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:16:19,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:16:19,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:19,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098156997] [2025-03-03 14:16:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098156997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26191591] [2025-03-03 14:16:19,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:19,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:19,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:19,731 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:19,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:16:19,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:16:19,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:16:19,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:19,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:19,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:19,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:20,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:20,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26191591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:20,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955444104] [2025-03-03 14:16:20,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:20,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:20,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:20,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:20,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:20,084 INFO L87 Difference]: Start difference. First operand 2578 states and 4260 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-03-03 14:16:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:21,438 INFO L93 Difference]: Finished difference Result 8373 states and 14191 transitions. [2025-03-03 14:16:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:21,439 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-03-03 14:16:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:21,473 INFO L225 Difference]: With dead ends: 8373 [2025-03-03 14:16:21,473 INFO L226 Difference]: Without dead ends: 5840 [2025-03-03 14:16:21,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:21,483 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1959 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:21,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2042 Valid, 876 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:16:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5840 states. [2025-03-03 14:16:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5840 to 5619. [2025-03-03 14:16:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5619 states, 4209 states have (on average 1.6248515086718935) internal successors, (6839), 4418 states have internal predecessors, (6839), 1131 states have call successors, (1131), 217 states have call predecessors, (1131), 278 states have return successors, (1530), 1131 states have call predecessors, (1530), 1126 states have call successors, (1530) [2025-03-03 14:16:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 9500 transitions. [2025-03-03 14:16:21,708 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 9500 transitions. Word has length 148 [2025-03-03 14:16:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:21,709 INFO L471 AbstractCegarLoop]: Abstraction has 5619 states and 9500 transitions. [2025-03-03 14:16:21,709 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-03-03 14:16:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 9500 transitions. [2025-03-03 14:16:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:16:21,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:21,713 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-03-03 14:16:21,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:21,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 14:16:21,914 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash 700581505, now seen corresponding path program 1 times [2025-03-03 14:16:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605161816] [2025-03-03 14:16:21,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:21,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:16:21,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:16:21,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:21,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:22,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:22,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605161816] [2025-03-03 14:16:22,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605161816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:22,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724399119] [2025-03-03 14:16:22,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:22,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:22,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:22,136 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:22,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:16:22,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:16:22,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:16:22,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:22,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:22,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:22,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:22,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:22,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724399119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:22,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166249886] [2025-03-03 14:16:22,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:22,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:22,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:22,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:22,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:22,435 INFO L87 Difference]: Start difference. First operand 5619 states and 9500 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-03-03 14:16:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:24,082 INFO L93 Difference]: Finished difference Result 18706 states and 32871 transitions. [2025-03-03 14:16:24,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:24,082 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-03-03 14:16:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:24,190 INFO L225 Difference]: With dead ends: 18706 [2025-03-03 14:16:24,190 INFO L226 Difference]: Without dead ends: 13132 [2025-03-03 14:16:24,224 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-03-03 14:16:24,225 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1944 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:24,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 873 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:16:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13132 states. [2025-03-03 14:16:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13132 to 12571. [2025-03-03 14:16:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12571 states, 9222 states have (on average 1.6165690739535892) internal successors, (14908), 9736 states have internal predecessors, (14908), 2755 states have call successors, (2755), 429 states have call predecessors, (2755), 593 states have return successors, (4247), 2779 states have call predecessors, (4247), 2750 states have call successors, (4247) [2025-03-03 14:16:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12571 states to 12571 states and 21910 transitions. [2025-03-03 14:16:24,872 INFO L78 Accepts]: Start accepts. Automaton has 12571 states and 21910 transitions. Word has length 149 [2025-03-03 14:16:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:24,875 INFO L471 AbstractCegarLoop]: Abstraction has 12571 states and 21910 transitions. [2025-03-03 14:16:24,875 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-03-03 14:16:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 12571 states and 21910 transitions. [2025-03-03 14:16:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:16:24,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:24,880 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-03-03 14:16:24,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:25,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 14:16:25,082 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:25,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:25,083 INFO L85 PathProgramCache]: Analyzing trace with hash 242989818, now seen corresponding path program 1 times [2025-03-03 14:16:25,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:25,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586583310] [2025-03-03 14:16:25,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:25,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:25,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:16:25,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:16:25,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:25,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:25,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:25,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586583310] [2025-03-03 14:16:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586583310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:25,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321462036] [2025-03-03 14:16:25,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:25,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:25,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:25,252 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:25,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 14:16:25,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:16:25,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:16:25,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:25,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:25,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 1522 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:25,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:25,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:25,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321462036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:25,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:25,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:25,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545123752] [2025-03-03 14:16:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:25,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:25,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:25,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:25,553 INFO L87 Difference]: Start difference. First operand 12571 states and 21910 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-03-03 14:16:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:28,242 INFO L93 Difference]: Finished difference Result 42597 states and 78997 transitions. [2025-03-03 14:16:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:28,242 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-03-03 14:16:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:28,503 INFO L225 Difference]: With dead ends: 42597 [2025-03-03 14:16:28,503 INFO L226 Difference]: Without dead ends: 30071 [2025-03-03 14:16:28,591 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-03-03 14:16:28,592 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 1932 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2013 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:28,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2013 Valid, 867 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:16:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30071 states. [2025-03-03 14:16:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30071 to 28863. [2025-03-03 14:16:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28863 states, 20695 states have (on average 1.6049770475960377) internal successors, (33215), 21978 states have internal predecessors, (33215), 6887 states have call successors, (6887), 853 states have call predecessors, (6887), 1280 states have return successors, (12384), 6995 states have call predecessors, (12384), 6882 states have call successors, (12384) [2025-03-03 14:16:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28863 states to 28863 states and 52486 transitions. [2025-03-03 14:16:30,401 INFO L78 Accepts]: Start accepts. Automaton has 28863 states and 52486 transitions. Word has length 150 [2025-03-03 14:16:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:30,401 INFO L471 AbstractCegarLoop]: Abstraction has 28863 states and 52486 transitions. [2025-03-03 14:16:30,402 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-03-03 14:16:30,402 INFO L276 IsEmpty]: Start isEmpty. Operand 28863 states and 52486 transitions. [2025-03-03 14:16:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:16:30,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:30,407 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-03-03 14:16:30,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:30,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 14:16:30,608 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:30,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1057454373, now seen corresponding path program 1 times [2025-03-03 14:16:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:30,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147096631] [2025-03-03 14:16:30,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:30,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:16:30,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:16:30,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:30,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147096631] [2025-03-03 14:16:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147096631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970979490] [2025-03-03 14:16:30,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:30,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:30,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:30,867 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:30,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 14:16:30,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:16:31,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:16:31,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:31,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:31,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1524 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:31,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:31,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:31,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970979490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:31,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:31,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:31,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125507832] [2025-03-03 14:16:31,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:31,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:31,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:31,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:31,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:31,194 INFO L87 Difference]: Start difference. First operand 28863 states and 52486 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-03-03 14:16:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:36,006 INFO L93 Difference]: Finished difference Result 99021 states and 199294 transitions. [2025-03-03 14:16:36,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:36,007 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-03-03 14:16:36,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:36,534 INFO L225 Difference]: With dead ends: 99021 [2025-03-03 14:16:36,535 INFO L226 Difference]: Without dead ends: 70193 [2025-03-03 14:16:36,694 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-03-03 14:16:36,694 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1906 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:36,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1986 Valid, 965 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:16:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70193 states. [2025-03-03 14:16:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70193 to 68017. [2025-03-03 14:16:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68017 states, 47624 states have (on average 1.5914244918528473) internal successors, (75790), 50864 states have internal predecessors, (75790), 17593 states have call successors, (17593), 1698 states have call predecessors, (17593), 2799 states have return successors, (37934), 17976 states have call predecessors, (37934), 17588 states have call successors, (37934) [2025-03-03 14:16:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68017 states to 68017 states and 131317 transitions. [2025-03-03 14:16:41,695 INFO L78 Accepts]: Start accepts. Automaton has 68017 states and 131317 transitions. Word has length 151 [2025-03-03 14:16:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:41,695 INFO L471 AbstractCegarLoop]: Abstraction has 68017 states and 131317 transitions. [2025-03-03 14:16:41,695 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-03-03 14:16:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 68017 states and 131317 transitions. [2025-03-03 14:16:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 14:16:41,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:41,713 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:41,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 14:16:41,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:41,914 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:41,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2105916063, now seen corresponding path program 1 times [2025-03-03 14:16:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:41,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776094448] [2025-03-03 14:16:41,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:41,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 14:16:41,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 14:16:41,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:41,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 14:16:42,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:42,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776094448] [2025-03-03 14:16:42,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776094448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:42,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46814312] [2025-03-03 14:16:42,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:42,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:42,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:42,129 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:42,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 14:16:42,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 14:16:42,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 14:16:42,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:42,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:42,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:16:42,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:16:42,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:42,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46814312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:42,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:42,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:42,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11252096] [2025-03-03 14:16:42,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:42,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:42,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:42,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:42,461 INFO L87 Difference]: Start difference. First operand 68017 states and 131317 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:16:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:47,731 INFO L93 Difference]: Finished difference Result 138868 states and 278950 transitions. [2025-03-03 14:16:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 206 [2025-03-03 14:16:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:48,387 INFO L225 Difference]: With dead ends: 138868 [2025-03-03 14:16:48,388 INFO L226 Difference]: Without dead ends: 70897 [2025-03-03 14:16:48,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 212 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-03-03 14:16:48,856 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 144 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2449 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-03-03 14:16:48,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2449 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2025-03-03 14:16:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 70513. [2025-03-03 14:16:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70513 states, 50056 states have (on average 1.607439667572319) internal successors, (80462), 53296 states have internal predecessors, (80462), 17593 states have call successors, (17593), 1762 states have call predecessors, (17593), 2863 states have return successors, (37934), 17976 states have call predecessors, (37934), 17588 states have call successors, (37934) [2025-03-03 14:16:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70513 states to 70513 states and 135989 transitions. [2025-03-03 14:16:53,084 INFO L78 Accepts]: Start accepts. Automaton has 70513 states and 135989 transitions. Word has length 206 [2025-03-03 14:16:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:53,085 INFO L471 AbstractCegarLoop]: Abstraction has 70513 states and 135989 transitions. [2025-03-03 14:16:53,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:16:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 70513 states and 135989 transitions. [2025-03-03 14:16:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-03 14:16:53,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:53,100 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:16:53,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:53,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 14:16:53,301 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:53,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:53,301 INFO L85 PathProgramCache]: Analyzing trace with hash 774236485, now seen corresponding path program 1 times [2025-03-03 14:16:53,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:53,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720905604] [2025-03-03 14:16:53,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:53,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-03 14:16:53,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-03 14:16:53,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:53,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-03-03 14:16:54,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720905604] [2025-03-03 14:16:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720905604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889312473] [2025-03-03 14:16:54,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:54,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:54,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:54,295 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:54,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 14:16:54,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-03 14:16:54,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-03 14:16:54,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:54,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:54,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 2413 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:16:54,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 14:16:55,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:16:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-03 14:16:56,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889312473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:16:56,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:16:56,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2025-03-03 14:16:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388878868] [2025-03-03 14:16:56,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:16:56,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 14:16:56,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:56,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 14:16:56,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:16:56,344 INFO L87 Difference]: Start difference. First operand 70513 states and 135989 transitions. Second operand has 25 states, 25 states have (on average 16.96) internal successors, (424), 23 states have internal predecessors, (424), 14 states have call successors, (92), 8 states have call predecessors, (92), 15 states have return successors, (94), 18 states have call predecessors, (94), 13 states have call successors, (94)