./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_spec3_product22.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 10f09c8c5639b403d441157c6cb90f176690981c36f4af5417d0103735cbe364 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:27:46,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:27:46,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:27:46,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:27:46,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:27:46,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:27:46,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:27:46,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:27:46,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:27:46,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:27:46,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:27:46,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:27:46,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:27:46,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:27:46,666 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:27:46,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:27:46,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:27:46,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:27:46,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:27:46,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:27:46,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:27:46,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:27:46,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:27:46,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:27:46,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:27:46,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:27:46,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:27:46,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:27:46,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:27:46,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:27:46,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:27:46,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:27:46,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:27:46,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:27:46,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:27:46,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:27:46,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:27:46,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:27:46,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:27:46,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:27:46,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:27:46,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:27:46,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:27:46,669 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 -> 10f09c8c5639b403d441157c6cb90f176690981c36f4af5417d0103735cbe364 [2025-03-08 05:27:46,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:27:46,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:27:46,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:27:46,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:27:46,895 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:27:46,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c [2025-03-08 05:27:47,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1157e5d50/d5b2969b5392443183f2cc8512c8599b/FLAG951587343 [2025-03-08 05:27:48,283 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:27:48,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c [2025-03-08 05:27:48,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1157e5d50/d5b2969b5392443183f2cc8512c8599b/FLAG951587343 [2025-03-08 05:27:48,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1157e5d50/d5b2969b5392443183f2cc8512c8599b [2025-03-08 05:27:48,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:27:48,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:27:48,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:27:48,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:27:48,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:27:48,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87f8b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48, skipping insertion in model container [2025-03-08 05:27:48,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:27:48,520 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_spec3_product22.cil.c[3205,3218] [2025-03-08 05:27:48,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:27:48,717 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:27:48,722 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-03-08 05:27:48,723 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] [2025-03-08 05:27:48,724 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [159] [2025-03-08 05:27:48,724 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [525] [2025-03-08 05:27:48,724 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [563] [2025-03-08 05:27:48,724 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [752] [2025-03-08 05:27:48,724 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1102] [2025-03-08 05:27:48,725 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1769] [2025-03-08 05:27:48,725 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1784] [2025-03-08 05:27:48,726 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1904] [2025-03-08 05:27:48,734 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_spec3_product22.cil.c[3205,3218] [2025-03-08 05:27:48,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:27:48,815 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:27:48,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48 WrapperNode [2025-03-08 05:27:48,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:27:48,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:27:48,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:27:48,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:27:48,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,867 INFO L138 Inliner]: procedures = 92, calls = 351, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 901 [2025-03-08 05:27:48,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:27:48,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:27:48,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:27:48,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:27:48,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,905 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-08 05:27:48,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:27:48,933 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:27:48,933 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:27:48,933 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:27:48,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (1/1) ... [2025-03-08 05:27:48,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:27:48,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:48,968 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-08 05:27:48,972 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-08 05:27:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:27:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-08 05:27:48,991 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-08 05:27:48,991 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:27:48,991 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:27:48,991 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:27:48,991 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:27:48,991 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:27:48,991 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:27:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-08 05:27:48,992 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-08 05:27:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:27:48,992 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:27:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:27:48,992 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:27:48,993 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:27:48,993 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:27:48,993 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:27:48,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:27:48,993 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:27:48,993 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:27:48,993 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:27:48,993 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:27:48,993 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:27:48,994 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:27:48,994 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:27:48,994 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:27:48,994 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-08 05:27:48,994 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-08 05:27:48,994 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:27:48,994 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:27:48,994 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-08 05:27:48,994 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-08 05:27:48,994 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:27:48,994 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:27:48,994 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:27:48,994 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:27:48,994 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:27:48,994 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:27:48,994 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:27:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-08 05:27:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:27:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:27:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:27:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-03-08 05:27:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-03-08 05:27:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:27:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:27:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:27:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:27:49,157 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:27:49,159 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:27:49,188 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2181: #res := ~retValue_acc~17; [2025-03-08 05:27:49,211 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823: #res := ~retValue_acc~10; [2025-03-08 05:27:49,273 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705: #res#1 := ~retValue_acc~22#1; [2025-03-08 05:27:49,273 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~23#1; [2025-03-08 05:27:49,285 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2837: #res := ~retValue_acc~26; [2025-03-08 05:27:49,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2301-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-08 05:27:49,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2314-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-08 05:27:49,481 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2138-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; [2025-03-08 05:27:49,487 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1766: #res := ~retValue_acc~9; [2025-03-08 05:27:49,503 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901: #res := ~retValue_acc~12; [2025-03-08 05:27:49,507 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976: #res := ~retValue_acc~13; [2025-03-08 05:27:49,509 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: #res := ~retValue_acc~14; [2025-03-08 05:27:49,651 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862: #res := ~retValue_acc~11; [2025-03-08 05:27:49,668 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2172: #res := ~retValue_acc~16; [2025-03-08 05:27:49,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1455: #res := ~retValue_acc~8; [2025-03-08 05:27:49,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~24#1; [2025-03-08 05:27:49,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2823-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~25#1; [2025-03-08 05:27:49,908 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2666: #res := ~retValue_acc~21; [2025-03-08 05:27:49,976 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L560-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-03-08 05:27:49,976 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1099-1: main_#res#1 := main_~retValue_acc~6#1; [2025-03-08 05:27:49,983 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1219: #res := ~retValue_acc~7; [2025-03-08 05:27:50,126 INFO L? ?]: Removed 462 outVars from TransFormulas that were not future-live. [2025-03-08 05:27:50,126 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:27:50,151 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:27:50,152 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:27:50,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:50 BoogieIcfgContainer [2025-03-08 05:27:50,152 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:27:50,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:27:50,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:27:50,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:27:50,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:27:48" (1/3) ... [2025-03-08 05:27:50,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33393e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:50, skipping insertion in model container [2025-03-08 05:27:50,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:48" (2/3) ... [2025-03-08 05:27:50,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33393e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:50, skipping insertion in model container [2025-03-08 05:27:50,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:50" (3/3) ... [2025-03-08 05:27:50,160 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product22.cil.c [2025-03-08 05:27:50,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:27:50,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product22.cil.c that has 28 procedures, 594 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:27:50,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:27:50,238 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;@258a2843, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:27:50,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:27:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 594 states, 457 states have (on average 1.6739606126914661) internal successors, (765), 477 states have internal predecessors, (765), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 05:27:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:27:50,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:50,256 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:50,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:50,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash -737784710, now seen corresponding path program 1 times [2025-03-08 05:27:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:50,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973558874] [2025-03-08 05:27:50,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:50,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:50,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:27:50,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:27:50,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:50,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:50,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:50,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973558874] [2025-03-08 05:27:50,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973558874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:50,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:50,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978714024] [2025-03-08 05:27:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:50,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:50,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:50,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:50,857 INFO L87 Difference]: Start difference. First operand has 594 states, 457 states have (on average 1.6739606126914661) internal successors, (765), 477 states have internal predecessors, (765), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:51,040 INFO L93 Difference]: Finished difference Result 1185 states and 1974 transitions. [2025-03-08 05:27:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:51,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2025-03-08 05:27:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:51,059 INFO L225 Difference]: With dead ends: 1185 [2025-03-08 05:27:51,059 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 05:27:51,068 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-08 05:27:51,070 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 91 mSDsluCounter, 4749 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5716 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:51,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5716 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 05:27:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2025-03-08 05:27:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 460 states have (on average 1.6673913043478261) internal successors, (767), 480 states have internal predecessors, (767), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 103 states have call predecessors, (108), 106 states have call successors, (108) [2025-03-08 05:27:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 984 transitions. [2025-03-08 05:27:51,147 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 984 transitions. Word has length 67 [2025-03-08 05:27:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:51,148 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 984 transitions. [2025-03-08 05:27:51,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 984 transitions. [2025-03-08 05:27:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:27:51,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:51,154 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:51,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:27:51,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:51,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:51,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1350163369, now seen corresponding path program 1 times [2025-03-08 05:27:51,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:51,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872799710] [2025-03-08 05:27:51,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:51,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:27:51,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:27:51,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:51,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:51,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:51,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872799710] [2025-03-08 05:27:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872799710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:51,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:51,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:51,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846466028] [2025-03-08 05:27:51,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:51,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:51,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:51,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:51,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:51,334 INFO L87 Difference]: Start difference. First operand 597 states and 984 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:51,410 INFO L93 Difference]: Finished difference Result 1176 states and 1949 transitions. [2025-03-08 05:27:51,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:51,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-03-08 05:27:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:51,418 INFO L225 Difference]: With dead ends: 1176 [2025-03-08 05:27:51,418 INFO L226 Difference]: Without dead ends: 573 [2025-03-08 05:27:51,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:51,422 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 14 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2857 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:51,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2857 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-08 05:27:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2025-03-08 05:27:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 439 states have (on average 1.6583143507972664) internal successors, (728), 457 states have internal predecessors, (728), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 941 transitions. [2025-03-08 05:27:51,455 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 941 transitions. Word has length 68 [2025-03-08 05:27:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:51,456 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 941 transitions. [2025-03-08 05:27:51,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 941 transitions. [2025-03-08 05:27:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:27:51,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:51,461 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:51,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:27:51,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:51,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash -937990064, now seen corresponding path program 1 times [2025-03-08 05:27:51,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:51,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355993827] [2025-03-08 05:27:51,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:51,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:51,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:27:51,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:27:51,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:51,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:51,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:51,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355993827] [2025-03-08 05:27:51,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355993827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:51,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:51,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:51,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532028147] [2025-03-08 05:27:51,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:51,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:51,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:51,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:51,714 INFO L87 Difference]: Start difference. First operand 573 states and 941 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:51,805 INFO L93 Difference]: Finished difference Result 1139 states and 1881 transitions. [2025-03-08 05:27:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:51,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-03-08 05:27:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:51,813 INFO L225 Difference]: With dead ends: 1139 [2025-03-08 05:27:51,813 INFO L226 Difference]: Without dead ends: 567 [2025-03-08 05:27:51,818 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-08 05:27:51,819 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 77 mSDsluCounter, 4580 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5510 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:51,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5510 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-08 05:27:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-03-08 05:27:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 433 states have (on average 1.651270207852194) internal successors, (715), 451 states have internal predecessors, (715), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 928 transitions. [2025-03-08 05:27:51,851 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 928 transitions. Word has length 68 [2025-03-08 05:27:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:51,852 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 928 transitions. [2025-03-08 05:27:51,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 928 transitions. [2025-03-08 05:27:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:27:51,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:51,854 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:51,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:27:51,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:51,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2044533868, now seen corresponding path program 1 times [2025-03-08 05:27:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:51,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722162482] [2025-03-08 05:27:51,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:51,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:51,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:27:51,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:27:51,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:51,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:52,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722162482] [2025-03-08 05:27:52,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722162482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:52,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:52,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:52,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121912185] [2025-03-08 05:27:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:52,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:52,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:52,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:52,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:52,030 INFO L87 Difference]: Start difference. First operand 567 states and 928 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:52,088 INFO L93 Difference]: Finished difference Result 1127 states and 1855 transitions. [2025-03-08 05:27:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-03-08 05:27:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:52,092 INFO L225 Difference]: With dead ends: 1127 [2025-03-08 05:27:52,093 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 05:27:52,095 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-08 05:27:52,095 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 63 mSDsluCounter, 4532 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:52,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5450 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 05:27:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-03-08 05:27:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 427 states have (on average 1.6440281030444965) internal successors, (702), 445 states have internal predecessors, (702), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 915 transitions. [2025-03-08 05:27:52,120 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 915 transitions. Word has length 69 [2025-03-08 05:27:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:52,120 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 915 transitions. [2025-03-08 05:27:52,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 915 transitions. [2025-03-08 05:27:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:27:52,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:52,122 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:52,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:27:52,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:52,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1182798550, now seen corresponding path program 1 times [2025-03-08 05:27:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:52,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922066054] [2025-03-08 05:27:52,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:52,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:52,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:27:52,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:27:52,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:52,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:52,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:52,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922066054] [2025-03-08 05:27:52,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922066054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:52,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358890302] [2025-03-08 05:27:52,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:52,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:52,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:52,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:52,267 INFO L87 Difference]: Start difference. First operand 561 states and 915 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:52,329 INFO L93 Difference]: Finished difference Result 1115 states and 1829 transitions. [2025-03-08 05:27:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:52,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-03-08 05:27:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:52,333 INFO L225 Difference]: With dead ends: 1115 [2025-03-08 05:27:52,333 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 05:27:52,336 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-08 05:27:52,336 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 49 mSDsluCounter, 4484 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:52,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5390 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:52,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 05:27:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-08 05:27:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 421 states have (on average 1.6365795724465557) internal successors, (689), 439 states have internal predecessors, (689), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 902 transitions. [2025-03-08 05:27:52,357 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 902 transitions. Word has length 70 [2025-03-08 05:27:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:52,357 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 902 transitions. [2025-03-08 05:27:52,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 902 transitions. [2025-03-08 05:27:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:27:52,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:52,358 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:52,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:27:52,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:52,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2089375074, now seen corresponding path program 1 times [2025-03-08 05:27:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316815894] [2025-03-08 05:27:52,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:52,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:27:52,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:27:52,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:52,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:52,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:52,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316815894] [2025-03-08 05:27:52,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316815894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:52,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:52,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938635446] [2025-03-08 05:27:52,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:52,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:52,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:52,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:52,501 INFO L87 Difference]: Start difference. First operand 555 states and 902 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:52,559 INFO L93 Difference]: Finished difference Result 1103 states and 1803 transitions. [2025-03-08 05:27:52,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:52,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-03-08 05:27:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:52,563 INFO L225 Difference]: With dead ends: 1103 [2025-03-08 05:27:52,563 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 05:27:52,566 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-08 05:27:52,567 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 24 mSDsluCounter, 4448 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5342 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:52,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5342 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 05:27:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-08 05:27:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 421 states have (on average 1.6342042755344417) internal successors, (688), 439 states have internal predecessors, (688), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 901 transitions. [2025-03-08 05:27:52,590 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 901 transitions. Word has length 70 [2025-03-08 05:27:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:52,590 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 901 transitions. [2025-03-08 05:27:52,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 901 transitions. [2025-03-08 05:27:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:27:52,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:52,592 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:52,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:27:52,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:52,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash 566047406, now seen corresponding path program 1 times [2025-03-08 05:27:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:52,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5705965] [2025-03-08 05:27:52,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:52,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:27:52,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:27:52,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:52,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:52,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5705965] [2025-03-08 05:27:52,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5705965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:52,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:52,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:52,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803572441] [2025-03-08 05:27:52,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:52,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:52,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:52,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:52,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:52,669 INFO L87 Difference]: Start difference. First operand 555 states and 901 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:52,710 INFO L93 Difference]: Finished difference Result 1094 states and 1788 transitions. [2025-03-08 05:27:52,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:52,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-03-08 05:27:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:52,716 INFO L225 Difference]: With dead ends: 1094 [2025-03-08 05:27:52,716 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 05:27:52,718 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-08 05:27:52,719 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 15 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:52,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2643 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 05:27:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-08 05:27:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 421 states have (on average 1.631828978622328) internal successors, (687), 439 states have internal predecessors, (687), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 900 transitions. [2025-03-08 05:27:52,738 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 900 transitions. Word has length 71 [2025-03-08 05:27:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:52,738 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 900 transitions. [2025-03-08 05:27:52,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 900 transitions. [2025-03-08 05:27:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:27:52,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:52,741 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:52,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:27:52,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:52,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:52,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1314586830, now seen corresponding path program 1 times [2025-03-08 05:27:52,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:52,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841642634] [2025-03-08 05:27:52,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:52,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:52,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:27:52,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:27:52,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:52,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:52,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:52,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841642634] [2025-03-08 05:27:52,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841642634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:52,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:52,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:52,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898052332] [2025-03-08 05:27:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:52,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:52,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:52,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:52,832 INFO L87 Difference]: Start difference. First operand 555 states and 900 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:52,872 INFO L93 Difference]: Finished difference Result 1094 states and 1786 transitions. [2025-03-08 05:27:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-03-08 05:27:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:52,877 INFO L225 Difference]: With dead ends: 1094 [2025-03-08 05:27:52,877 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 05:27:52,879 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-08 05:27:52,879 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 14 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:52,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2645 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 05:27:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-08 05:27:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 421 states have (on average 1.6294536817102139) internal successors, (686), 439 states have internal predecessors, (686), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 899 transitions. [2025-03-08 05:27:52,897 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 899 transitions. Word has length 72 [2025-03-08 05:27:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:52,897 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 899 transitions. [2025-03-08 05:27:52,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 899 transitions. [2025-03-08 05:27:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 05:27:52,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:52,900 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:52,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:27:52,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:52,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:52,901 INFO L85 PathProgramCache]: Analyzing trace with hash 964417713, now seen corresponding path program 1 times [2025-03-08 05:27:52,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:52,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386934700] [2025-03-08 05:27:52,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:52,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:52,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 05:27:52,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 05:27:52,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:52,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386934700] [2025-03-08 05:27:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386934700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:52,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422756596] [2025-03-08 05:27:52,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:52,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:52,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:52,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:52,970 INFO L87 Difference]: Start difference. First operand 555 states and 899 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:53,004 INFO L93 Difference]: Finished difference Result 1094 states and 1784 transitions. [2025-03-08 05:27:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:53,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-08 05:27:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:53,008 INFO L225 Difference]: With dead ends: 1094 [2025-03-08 05:27:53,008 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 05:27:53,010 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-08 05:27:53,010 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 13 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2647 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-08 05:27:53,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2647 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 05:27:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-08 05:27:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 421 states have (on average 1.6270783847980999) internal successors, (685), 439 states have internal predecessors, (685), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 898 transitions. [2025-03-08 05:27:53,025 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 898 transitions. Word has length 73 [2025-03-08 05:27:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:53,025 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 898 transitions. [2025-03-08 05:27:53,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 898 transitions. [2025-03-08 05:27:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:27:53,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:53,026 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:53,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:27:53,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:53,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:53,027 INFO L85 PathProgramCache]: Analyzing trace with hash -951761771, now seen corresponding path program 1 times [2025-03-08 05:27:53,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:53,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389792674] [2025-03-08 05:27:53,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:53,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:27:53,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:27:53,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:53,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:53,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:53,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389792674] [2025-03-08 05:27:53,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389792674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:53,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:53,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:53,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428597032] [2025-03-08 05:27:53,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:53,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:53,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:53,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:53,093 INFO L87 Difference]: Start difference. First operand 555 states and 898 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:53,127 INFO L93 Difference]: Finished difference Result 1094 states and 1782 transitions. [2025-03-08 05:27:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:53,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-08 05:27:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:53,133 INFO L225 Difference]: With dead ends: 1094 [2025-03-08 05:27:53,133 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 05:27:53,135 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-08 05:27:53,135 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 12 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:53,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2649 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 05:27:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-08 05:27:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 421 states have (on average 1.6247030878859858) internal successors, (684), 439 states have internal predecessors, (684), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:27:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 897 transitions. [2025-03-08 05:27:53,154 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 897 transitions. Word has length 74 [2025-03-08 05:27:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:53,154 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 897 transitions. [2025-03-08 05:27:53,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 897 transitions. [2025-03-08 05:27:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 05:27:53,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:53,155 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:53,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:27:53,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:53,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:53,156 INFO L85 PathProgramCache]: Analyzing trace with hash 225340084, now seen corresponding path program 1 times [2025-03-08 05:27:53,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:53,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433209775] [2025-03-08 05:27:53,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:53,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:27:53,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:27:53,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:53,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:27:53,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:53,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433209775] [2025-03-08 05:27:53,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433209775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:53,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480030627] [2025-03-08 05:27:53,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:53,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:53,370 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-08 05:27:53,372 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-08 05:27:53,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:27:53,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:27:53,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:53,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:53,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:27:53,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:27:53,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:53,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480030627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:53,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:53,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 05:27:53,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561196237] [2025-03-08 05:27:53,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:53,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:53,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:53,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:53,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:27:53,679 INFO L87 Difference]: Start difference. First operand 555 states and 897 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:53,728 INFO L93 Difference]: Finished difference Result 1576 states and 2579 transitions. [2025-03-08 05:27:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-08 05:27:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:53,735 INFO L225 Difference]: With dead ends: 1576 [2025-03-08 05:27:53,736 INFO L226 Difference]: Without dead ends: 1039 [2025-03-08 05:27:53,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:27:53,738 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 859 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:53,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1697 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-03-08 05:27:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1024. [2025-03-08 05:27:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 784 states have (on average 1.6377551020408163) internal successors, (1284), 819 states have internal predecessors, (1284), 191 states have call successors, (191), 49 states have call predecessors, (191), 48 states have return successors, (193), 183 states have call predecessors, (193), 188 states have call successors, (193) [2025-03-08 05:27:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1668 transitions. [2025-03-08 05:27:53,770 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1668 transitions. Word has length 75 [2025-03-08 05:27:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:53,771 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1668 transitions. [2025-03-08 05:27:53,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1668 transitions. [2025-03-08 05:27:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:27:53,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:53,775 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:53,784 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-08 05:27:53,980 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,SelfDestructingSolverStorable10 [2025-03-08 05:27:53,980 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:53,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:53,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1478852538, now seen corresponding path program 1 times [2025-03-08 05:27:53,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:53,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364138006] [2025-03-08 05:27:53,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:53,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:53,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:27:54,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:27:54,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:54,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:27:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364138006] [2025-03-08 05:27:54,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364138006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313189814] [2025-03-08 05:27:54,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:54,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:54,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:54,166 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-08 05:27:54,167 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-08 05:27:54,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:27:54,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:27:54,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:54,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:54,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:27:54,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:27:54,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:54,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313189814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:54,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:54,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 05:27:54,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513641836] [2025-03-08 05:27:54,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:54,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:54,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:54,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:54,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:27:54,465 INFO L87 Difference]: Start difference. First operand 1024 states and 1668 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:54,535 INFO L93 Difference]: Finished difference Result 2514 states and 4123 transitions. [2025-03-08 05:27:54,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:54,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-03-08 05:27:54,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:54,545 INFO L225 Difference]: With dead ends: 2514 [2025-03-08 05:27:54,546 INFO L226 Difference]: Without dead ends: 1508 [2025-03-08 05:27:54,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:27:54,551 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 857 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:54,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1752 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-03-08 05:27:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1460. [2025-03-08 05:27:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1120 states have (on average 1.65) internal successors, (1848), 1172 states have internal predecessors, (1848), 271 states have call successors, (271), 68 states have call predecessors, (271), 68 states have return successors, (278), 261 states have call predecessors, (278), 268 states have call successors, (278) [2025-03-08 05:27:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2397 transitions. [2025-03-08 05:27:54,607 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2397 transitions. Word has length 76 [2025-03-08 05:27:54,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:54,607 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 2397 transitions. [2025-03-08 05:27:54,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2397 transitions. [2025-03-08 05:27:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:27:54,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:54,609 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:54,618 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-08 05:27:54,810 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,SelfDestructingSolverStorable11 [2025-03-08 05:27:54,810 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:54,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 644101533, now seen corresponding path program 1 times [2025-03-08 05:27:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:54,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717194129] [2025-03-08 05:27:54,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:54,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:27:54,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:27:54,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:54,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717194129] [2025-03-08 05:27:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717194129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:54,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:54,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248108209] [2025-03-08 05:27:54,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:54,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:54,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:54,935 INFO L87 Difference]: Start difference. First operand 1460 states and 2397 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:27:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:55,436 INFO L93 Difference]: Finished difference Result 4304 states and 7222 transitions. [2025-03-08 05:27:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:55,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2025-03-08 05:27:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:55,456 INFO L225 Difference]: With dead ends: 4304 [2025-03-08 05:27:55,456 INFO L226 Difference]: Without dead ends: 2862 [2025-03-08 05:27:55,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:55,465 INFO L435 NwaCegarLoop]: 1032 mSDtfsCounter, 887 mSDsluCounter, 3689 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 4721 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:55,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 4721 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:27:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2025-03-08 05:27:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2815. [2025-03-08 05:27:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2161 states have (on average 1.6501619620546044) internal successors, (3566), 2261 states have internal predecessors, (3566), 521 states have call successors, (521), 130 states have call predecessors, (521), 132 states have return successors, (619), 507 states have call predecessors, (619), 517 states have call successors, (619) [2025-03-08 05:27:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4706 transitions. [2025-03-08 05:27:55,598 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4706 transitions. Word has length 78 [2025-03-08 05:27:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:55,598 INFO L471 AbstractCegarLoop]: Abstraction has 2815 states and 4706 transitions. [2025-03-08 05:27:55,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:27:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4706 transitions. [2025-03-08 05:27:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:27:55,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:55,601 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:55,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:27:55,602 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:55,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1009456592, now seen corresponding path program 1 times [2025-03-08 05:27:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135243930] [2025-03-08 05:27:55,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:55,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:55,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:27:55,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:27:55,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:55,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:27:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:55,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135243930] [2025-03-08 05:27:55,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135243930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:55,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035645896] [2025-03-08 05:27:55,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:55,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:55,751 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-08 05:27:55,776 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-08 05:27:55,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:27:56,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:27:56,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:56,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:56,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:27:56,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:27:56,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:56,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035645896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:56,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:56,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 05:27:56,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896098950] [2025-03-08 05:27:56,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:56,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:56,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:56,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:27:56,159 INFO L87 Difference]: Start difference. First operand 2815 states and 4706 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:27:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:56,835 INFO L93 Difference]: Finished difference Result 7618 states and 13016 transitions. [2025-03-08 05:27:56,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:56,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2025-03-08 05:27:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:56,874 INFO L225 Difference]: With dead ends: 7618 [2025-03-08 05:27:56,875 INFO L226 Difference]: Without dead ends: 4821 [2025-03-08 05:27:56,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:27:56,894 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 757 mSDsluCounter, 3172 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 4106 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:56,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 4106 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:27:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4821 states. [2025-03-08 05:27:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4821 to 4778. [2025-03-08 05:27:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4778 states, 3664 states have (on average 1.6037117903930131) internal successors, (5876), 3830 states have internal predecessors, (5876), 874 states have call successors, (874), 232 states have call predecessors, (874), 239 states have return successors, (1177), 855 states have call predecessors, (1177), 868 states have call successors, (1177) [2025-03-08 05:27:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 7927 transitions. [2025-03-08 05:27:57,137 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 7927 transitions. Word has length 79 [2025-03-08 05:27:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:57,138 INFO L471 AbstractCegarLoop]: Abstraction has 4778 states and 7927 transitions. [2025-03-08 05:27:57,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:27:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 7927 transitions. [2025-03-08 05:27:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:27:57,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:57,139 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:57,147 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-08 05:27:57,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:57,343 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:57,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash -185381683, now seen corresponding path program 1 times [2025-03-08 05:27:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:57,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609058818] [2025-03-08 05:27:57,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:57,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:27:57,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:27:57,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:57,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:57,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:57,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609058818] [2025-03-08 05:27:57,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609058818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:57,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:57,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:57,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479306510] [2025-03-08 05:27:57,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:57,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:57,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:57,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:57,425 INFO L87 Difference]: Start difference. First operand 4778 states and 7927 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:27:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:57,624 INFO L93 Difference]: Finished difference Result 9562 states and 16029 transitions. [2025-03-08 05:27:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:57,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-03-08 05:27:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:57,669 INFO L225 Difference]: With dead ends: 9562 [2025-03-08 05:27:57,670 INFO L226 Difference]: Without dead ends: 4802 [2025-03-08 05:27:57,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:57,702 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 12 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:57,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2613 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:27:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states. [2025-03-08 05:27:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4786. [2025-03-08 05:27:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4786 states, 3670 states have (on average 1.6021798365122615) internal successors, (5880), 3836 states have internal predecessors, (5880), 874 states have call successors, (874), 236 states have call predecessors, (874), 241 states have return successors, (1166), 853 states have call predecessors, (1166), 868 states have call successors, (1166) [2025-03-08 05:27:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4786 states to 4786 states and 7920 transitions. [2025-03-08 05:27:57,944 INFO L78 Accepts]: Start accepts. Automaton has 4786 states and 7920 transitions. Word has length 79 [2025-03-08 05:27:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:57,944 INFO L471 AbstractCegarLoop]: Abstraction has 4786 states and 7920 transitions. [2025-03-08 05:27:57,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:27:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4786 states and 7920 transitions. [2025-03-08 05:27:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:27:57,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:57,946 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:57,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:27:57,946 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:57,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2017389552, now seen corresponding path program 1 times [2025-03-08 05:27:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:57,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398579662] [2025-03-08 05:27:57,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:57,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:27:57,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:27:57,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:57,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:27:58,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398579662] [2025-03-08 05:27:58,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398579662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:58,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:58,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673277167] [2025-03-08 05:27:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:58,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:58,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:58,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:58,069 INFO L87 Difference]: Start difference. First operand 4786 states and 7920 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:27:58,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:58,744 INFO L93 Difference]: Finished difference Result 14291 states and 24641 transitions. [2025-03-08 05:27:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:58,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-03-08 05:27:58,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:58,820 INFO L225 Difference]: With dead ends: 14291 [2025-03-08 05:27:58,821 INFO L226 Difference]: Without dead ends: 9523 [2025-03-08 05:27:58,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:58,845 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 883 mSDsluCounter, 3590 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 4586 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:58,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 4586 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:27:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states. [2025-03-08 05:27:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 9454. [2025-03-08 05:27:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9454 states, 7252 states have (on average 1.598041919470491) internal successors, (11589), 7578 states have internal predecessors, (11589), 1720 states have call successors, (1720), 466 states have call predecessors, (1720), 481 states have return successors, (2824), 1689 states have call predecessors, (2824), 1710 states have call successors, (2824) [2025-03-08 05:27:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9454 states to 9454 states and 16133 transitions. [2025-03-08 05:27:59,243 INFO L78 Accepts]: Start accepts. Automaton has 9454 states and 16133 transitions. Word has length 87 [2025-03-08 05:27:59,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:59,244 INFO L471 AbstractCegarLoop]: Abstraction has 9454 states and 16133 transitions. [2025-03-08 05:27:59,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:27:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand 9454 states and 16133 transitions. [2025-03-08 05:27:59,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 05:27:59,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:59,245 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:27:59,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:27:59,246 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:59,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash 62957249, now seen corresponding path program 1 times [2025-03-08 05:27:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:59,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500969109] [2025-03-08 05:27:59,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:59,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 05:27:59,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 05:27:59,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:59,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:27:59,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:59,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500969109] [2025-03-08 05:27:59,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500969109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:59,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:59,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:59,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023216277] [2025-03-08 05:27:59,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:59,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:59,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:59,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:59,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:59,315 INFO L87 Difference]: Start difference. First operand 9454 states and 16133 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:27:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:59,769 INFO L93 Difference]: Finished difference Result 18962 states and 32839 transitions. [2025-03-08 05:27:59,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:59,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-03-08 05:27:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:59,849 INFO L225 Difference]: With dead ends: 18962 [2025-03-08 05:27:59,849 INFO L226 Difference]: Without dead ends: 9526 [2025-03-08 05:27:59,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:59,906 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 12 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:59,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2604 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9526 states. [2025-03-08 05:28:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9526 to 9494. [2025-03-08 05:28:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9494 states, 7288 states have (on average 1.595636663007684) internal successors, (11629), 7606 states have internal predecessors, (11629), 1720 states have call successors, (1720), 482 states have call predecessors, (1720), 485 states have return successors, (2808), 1685 states have call predecessors, (2808), 1710 states have call successors, (2808) [2025-03-08 05:28:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9494 states to 9494 states and 16157 transitions. [2025-03-08 05:28:00,348 INFO L78 Accepts]: Start accepts. Automaton has 9494 states and 16157 transitions. Word has length 88 [2025-03-08 05:28:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:00,350 INFO L471 AbstractCegarLoop]: Abstraction has 9494 states and 16157 transitions. [2025-03-08 05:28:00,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:28:00,350 INFO L276 IsEmpty]: Start isEmpty. Operand 9494 states and 16157 transitions. [2025-03-08 05:28:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:28:00,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:00,352 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:28:00,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:28:00,352 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:00,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:00,352 INFO L85 PathProgramCache]: Analyzing trace with hash -21853478, now seen corresponding path program 1 times [2025-03-08 05:28:00,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:00,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692958208] [2025-03-08 05:28:00,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:00,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:00,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:28:00,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:28:00,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:00,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:28:00,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:00,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692958208] [2025-03-08 05:28:00,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692958208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:00,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:00,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:00,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29584120] [2025-03-08 05:28:00,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:00,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:00,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:00,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:00,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:00,471 INFO L87 Difference]: Start difference. First operand 9494 states and 16157 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:28:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:01,361 INFO L93 Difference]: Finished difference Result 28493 states and 51453 transitions. [2025-03-08 05:28:01,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:01,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-03-08 05:28:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:01,501 INFO L225 Difference]: With dead ends: 28493 [2025-03-08 05:28:01,502 INFO L226 Difference]: Without dead ends: 19017 [2025-03-08 05:28:01,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:01,557 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 880 mSDsluCounter, 3613 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 4613 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:01,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 4613 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:28:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19017 states. [2025-03-08 05:28:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19017 to 18916. [2025-03-08 05:28:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18916 states, 14524 states have (on average 1.5920545304323879) internal successors, (23123), 15154 states have internal predecessors, (23123), 3418 states have call successors, (3418), 958 states have call predecessors, (3418), 973 states have return successors, (7187), 3363 states have call predecessors, (7187), 3400 states have call successors, (7187) [2025-03-08 05:28:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18916 states to 18916 states and 33728 transitions. [2025-03-08 05:28:02,382 INFO L78 Accepts]: Start accepts. Automaton has 18916 states and 33728 transitions. Word has length 97 [2025-03-08 05:28:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:02,383 INFO L471 AbstractCegarLoop]: Abstraction has 18916 states and 33728 transitions. [2025-03-08 05:28:02,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:28:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 18916 states and 33728 transitions. [2025-03-08 05:28:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:28:02,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:02,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:28:02,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:28:02,386 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:02,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1349749954, now seen corresponding path program 1 times [2025-03-08 05:28:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:02,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134821313] [2025-03-08 05:28:02,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:02,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:28:02,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:28:02,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:02,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:28:02,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:02,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134821313] [2025-03-08 05:28:02,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134821313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:02,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:02,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:02,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235102905] [2025-03-08 05:28:02,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:02,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:02,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:02,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:02,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:02,468 INFO L87 Difference]: Start difference. First operand 18916 states and 33728 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:03,402 INFO L93 Difference]: Finished difference Result 37958 states and 69240 transitions. [2025-03-08 05:28:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:03,403 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-03-08 05:28:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:03,606 INFO L225 Difference]: With dead ends: 37958 [2025-03-08 05:28:03,606 INFO L226 Difference]: Without dead ends: 19060 [2025-03-08 05:28:03,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:03,741 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 11 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:03,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2607 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19060 states. [2025-03-08 05:28:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19060 to 18996. [2025-03-08 05:28:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18996 states, 14596 states have (on average 1.5896821046862153) internal successors, (23203), 15226 states have internal predecessors, (23203), 3418 states have call successors, (3418), 974 states have call predecessors, (3418), 981 states have return successors, (7167), 3355 states have call predecessors, (7167), 3400 states have call successors, (7167) [2025-03-08 05:28:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18996 states to 18996 states and 33788 transitions. [2025-03-08 05:28:04,597 INFO L78 Accepts]: Start accepts. Automaton has 18996 states and 33788 transitions. Word has length 98 [2025-03-08 05:28:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:04,597 INFO L471 AbstractCegarLoop]: Abstraction has 18996 states and 33788 transitions. [2025-03-08 05:28:04,597 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 18996 states and 33788 transitions. [2025-03-08 05:28:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:28:04,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:04,599 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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-08 05:28:04,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:28:04,600 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:04,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash -696622446, now seen corresponding path program 1 times [2025-03-08 05:28:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:04,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740655484] [2025-03-08 05:28:04,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:04,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:28:04,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:28:04,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:04,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:28:04,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:04,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740655484] [2025-03-08 05:28:04,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740655484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:04,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:04,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:04,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802757466] [2025-03-08 05:28:04,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:04,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:04,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:04,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:04,707 INFO L87 Difference]: Start difference. First operand 18996 states and 33788 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:28:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:06,337 INFO L93 Difference]: Finished difference Result 57125 states and 111011 transitions. [2025-03-08 05:28:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:06,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-08 05:28:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:06,652 INFO L225 Difference]: With dead ends: 57125 [2025-03-08 05:28:06,652 INFO L226 Difference]: Without dead ends: 38147 [2025-03-08 05:28:06,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:06,774 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 876 mSDsluCounter, 3622 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 4620 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:06,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 4620 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:28:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38147 states. [2025-03-08 05:28:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38147 to 37982. [2025-03-08 05:28:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37982 states, 29188 states have (on average 1.5871248458270522) internal successors, (46325), 30442 states have internal predecessors, (46325), 6820 states have call successors, (6820), 1942 states have call predecessors, (6820), 1973 states have return successors, (19254), 6717 states have call predecessors, (19254), 6786 states have call successors, (19254) [2025-03-08 05:28:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37982 states to 37982 states and 72399 transitions. [2025-03-08 05:28:08,888 INFO L78 Accepts]: Start accepts. Automaton has 37982 states and 72399 transitions. Word has length 108 [2025-03-08 05:28:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:08,889 INFO L471 AbstractCegarLoop]: Abstraction has 37982 states and 72399 transitions. [2025-03-08 05:28:08,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:28:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 37982 states and 72399 transitions. [2025-03-08 05:28:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:28:08,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:08,892 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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-08 05:28:08,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:28:08,892 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:08,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash 357432461, now seen corresponding path program 1 times [2025-03-08 05:28:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224083924] [2025-03-08 05:28:08,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:08,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:28:08,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:28:08,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:08,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:28:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:09,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224083924] [2025-03-08 05:28:09,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224083924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:09,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:09,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:09,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764049531] [2025-03-08 05:28:09,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:09,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:09,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:09,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:09,186 INFO L87 Difference]: Start difference. First operand 37982 states and 72399 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:28:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:10,726 INFO L93 Difference]: Finished difference Result 76266 states and 150525 transitions. [2025-03-08 05:28:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:10,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-03-08 05:28:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:11,114 INFO L225 Difference]: With dead ends: 76266 [2025-03-08 05:28:11,114 INFO L226 Difference]: Without dead ends: 38302 [2025-03-08 05:28:11,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:11,432 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 9 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:11,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2604 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38302 states. [2025-03-08 05:28:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38302 to 38174. [2025-03-08 05:28:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38174 states, 29364 states have (on average 1.5841506606729328) internal successors, (46517), 30618 states have internal predecessors, (46517), 6820 states have call successors, (6820), 1974 states have call predecessors, (6820), 1989 states have return successors, (19238), 6701 states have call predecessors, (19238), 6786 states have call successors, (19238) [2025-03-08 05:28:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38174 states to 38174 states and 72575 transitions. [2025-03-08 05:28:13,665 INFO L78 Accepts]: Start accepts. Automaton has 38174 states and 72575 transitions. Word has length 109 [2025-03-08 05:28:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:13,665 INFO L471 AbstractCegarLoop]: Abstraction has 38174 states and 72575 transitions. [2025-03-08 05:28:13,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:28:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 38174 states and 72575 transitions. [2025-03-08 05:28:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 05:28:13,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:13,669 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 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] [2025-03-08 05:28:13,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:28:13,669 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:13,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash 907306059, now seen corresponding path program 1 times [2025-03-08 05:28:13,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:13,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340912782] [2025-03-08 05:28:13,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:13,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:13,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:28:13,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:28:13,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:13,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-08 05:28:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340912782] [2025-03-08 05:28:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340912782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613926111] [2025-03-08 05:28:13,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:13,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:13,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:13,916 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-08 05:28:13,918 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-08 05:28:14,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:28:14,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:28:14,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:14,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:14,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1874 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:28:14,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 05:28:14,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613926111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:14,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:14,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-08 05:28:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285349787] [2025-03-08 05:28:14,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:14,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:28:14,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:14,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:28:14,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:28:14,387 INFO L87 Difference]: Start difference. First operand 38174 states and 72575 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:28:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:21,636 INFO L93 Difference]: Finished difference Result 136221 states and 280056 transitions. [2025-03-08 05:28:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:28:21,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 148 [2025-03-08 05:28:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:22,520 INFO L225 Difference]: With dead ends: 136221 [2025-03-08 05:28:22,520 INFO L226 Difference]: Without dead ends: 98065 [2025-03-08 05:28:22,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:28:22,866 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 2512 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 6724 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2690 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 7241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 6724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:22,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2690 Valid, 2573 Invalid, 7241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 6724 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 05:28:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98065 states. [2025-03-08 05:28:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98065 to 96840. [2025-03-08 05:28:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96840 states, 74554 states have (on average 1.5775545242374656) internal successors, (117613), 77592 states have internal predecessors, (117613), 17064 states have call successors, (17064), 4934 states have call predecessors, (17064), 5221 states have return successors, (58055), 17049 states have call predecessors, (58055), 16998 states have call successors, (58055) [2025-03-08 05:28:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96840 states to 96840 states and 192732 transitions. [2025-03-08 05:28:28,724 INFO L78 Accepts]: Start accepts. Automaton has 96840 states and 192732 transitions. Word has length 148 [2025-03-08 05:28:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:28,725 INFO L471 AbstractCegarLoop]: Abstraction has 96840 states and 192732 transitions. [2025-03-08 05:28:28,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:28:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 96840 states and 192732 transitions. [2025-03-08 05:28:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:28:28,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:28,726 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:28,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:28:28,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:28,931 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:28,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash -523617588, now seen corresponding path program 1 times [2025-03-08 05:28:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:28,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926595849] [2025-03-08 05:28:28,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:28,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:28,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:28:28,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:28:28,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:28,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 05:28:29,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:29,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926595849] [2025-03-08 05:28:29,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926595849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:29,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:29,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:29,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710073478] [2025-03-08 05:28:29,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:29,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:29,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:29,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:29,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:29,062 INFO L87 Difference]: Start difference. First operand 96840 states and 192732 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13)