./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product09.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_spec9_product09.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 cc5b9f71a5434758faa1f6f3febe6f12c158e9feff610b938ef9d4658acd21ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:28:27,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:28:27,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:28:27,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:28:27,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:28:27,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:28:27,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:28:27,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:28:27,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:28:27,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:28:27,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:28:27,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:28:27,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:28:27,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:28:27,454 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:28:27,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:28:27,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:28:27,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:28:27,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:28:27,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:28:27,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:28:27,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:28:27,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:28:27,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:28:27,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:28:27,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:28:27,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:28:27,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:28:27,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:28:27,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:28:27,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:28:27,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:28:27,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:27,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:28:27,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:28:27,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:28:27,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:28:27,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:28:27,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:28:27,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:28:27,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:28:27,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:28:27,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:28:27,457 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 -> cc5b9f71a5434758faa1f6f3febe6f12c158e9feff610b938ef9d4658acd21ff [2025-03-08 05:28:27,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:28:27,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:28:27,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:28:27,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:28:27,700 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:28:27,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product09.cil.c [2025-03-08 05:28:28,956 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01672d91f/f9c3547a83f9439bb1744369b454e24f/FLAG25e0eab89 [2025-03-08 05:28:29,312 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:28:29,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product09.cil.c [2025-03-08 05:28:29,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01672d91f/f9c3547a83f9439bb1744369b454e24f/FLAG25e0eab89 [2025-03-08 05:28:29,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01672d91f/f9c3547a83f9439bb1744369b454e24f [2025-03-08 05:28:29,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:28:29,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:28:29,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:29,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:28:29,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:28:29,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:29,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721343d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29, skipping insertion in model container [2025-03-08 05:28:29,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:29,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:28:29,800 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_spec9_product09.cil.c[70349,70362] [2025-03-08 05:28:29,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:29,816 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:28:29,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-08 05:28:29,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [62] [2025-03-08 05:28:29,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [730] [2025-03-08 05:28:29,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1092] [2025-03-08 05:28:29,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2539] [2025-03-08 05:28:29,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [2905] [2025-03-08 05:28:29,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3065] [2025-03-08 05:28:29,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3184] [2025-03-08 05:28:29,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3275] [2025-03-08 05:28:29,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3310] [2025-03-08 05:28:29,900 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_spec9_product09.cil.c[70349,70362] [2025-03-08 05:28:29,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:29,923 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:28:29,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29 WrapperNode [2025-03-08 05:28:29,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:29,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:29,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:28:29,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:28:29,929 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:28:29" (1/1) ... [2025-03-08 05:28:29,944 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:28:29" (1/1) ... [2025-03-08 05:28:29,969 INFO L138 Inliner]: procedures = 89, calls = 327, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 767 [2025-03-08 05:28:29,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:29,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:28:29,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:28:29,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:28:29,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:29,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:29,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:30,006 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:28:30,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:30,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:30,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:30,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:30,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:30,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:30,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:28:30,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:28:30,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:28:30,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:28:30,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (1/1) ... [2025-03-08 05:28:30,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:30,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:30,077 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:28:30,080 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:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:28:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:28:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:28:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:28:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:28:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:28:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-08 05:28:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:28:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:28:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:28:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:28:30,098 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:28:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:28:30,098 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:28:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:28:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:28:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:28:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:28:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:28:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:28:30,218 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:28:30,219 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:28:30,258 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3181: #res := ~retValue_acc~23; [2025-03-08 05:28:30,260 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1168: #res := ~retValue_acc~5; [2025-03-08 05:28:30,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: #res := ~retValue_acc~13; [2025-03-08 05:28:30,614 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1963: #res := ~retValue_acc~16; [2025-03-08 05:28:30,624 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3142: #res := ~retValue_acc~22; [2025-03-08 05:28:30,642 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414: #res := ~retValue_acc~10; [2025-03-08 05:28:30,808 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1365-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~8#1; [2025-03-08 05:28:30,809 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1949-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~15#1; [2025-03-08 05:28:30,809 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1322-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~6#1; [2025-03-08 05:28:30,809 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1331-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~7#1; [2025-03-08 05:28:30,863 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1494-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-03-08 05:28:30,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1507-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-03-08 05:28:30,912 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: #res := ~retValue_acc~1; [2025-03-08 05:28:30,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-1: main_#res#1 := main_~retValue_acc~4#1; [2025-03-08 05:28:30,967 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3307-1: valid_product_#res#1 := valid_product_~retValue_acc~25#1; [2025-03-08 05:28:30,975 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: #res := ~retValue_acc~0; [2025-03-08 05:28:30,980 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: #res := ~retValue_acc~2; [2025-03-08 05:28:31,083 INFO L? ?]: Removed 415 outVars from TransFormulas that were not future-live. [2025-03-08 05:28:31,083 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:28:31,110 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:28:31,110 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:28:31,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:31 BoogieIcfgContainer [2025-03-08 05:28:31,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:28:31,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:28:31,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:28:31,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:28:31,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:28:29" (1/3) ... [2025-03-08 05:28:31,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94831a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:31, skipping insertion in model container [2025-03-08 05:28:31,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:29" (2/3) ... [2025-03-08 05:28:31,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94831a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:31, skipping insertion in model container [2025-03-08 05:28:31,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:31" (3/3) ... [2025-03-08 05:28:31,121 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product09.cil.c [2025-03-08 05:28:31,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:28:31,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product09.cil.c that has 21 procedures, 515 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:28:31,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:28:31,200 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;@455a8d08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:28:31,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:28:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 515 states, 410 states have (on average 1.721951219512195) internal successors, (706), 431 states have internal predecessors, (706), 83 states have call successors, (83), 20 states have call predecessors, (83), 20 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:28:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:28:31,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:31,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:31,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:31,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1944225760, now seen corresponding path program 1 times [2025-03-08 05:28:31,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:31,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751897099] [2025-03-08 05:28:31,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:31,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:28:31,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:28:31,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:31,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:31,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751897099] [2025-03-08 05:28:31,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751897099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:31,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:31,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:31,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85677926] [2025-03-08 05:28:31,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:31,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:31,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:31,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:31,716 INFO L87 Difference]: Start difference. First operand has 515 states, 410 states have (on average 1.721951219512195) internal successors, (706), 431 states have internal predecessors, (706), 83 states have call successors, (83), 20 states have call predecessors, (83), 20 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:31,847 INFO L93 Difference]: Finished difference Result 1010 states and 1719 transitions. [2025-03-08 05:28:31,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:31,849 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2025-03-08 05:28:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:31,864 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 05:28:31,864 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 05:28:31,870 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:28:31,872 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 5 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2552 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:31,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2552 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 05:28:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 05:28:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 404 states have (on average 1.7202970297029703) internal successors, (695), 423 states have internal predecessors, (695), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 856 transitions. [2025-03-08 05:28:31,934 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 856 transitions. Word has length 76 [2025-03-08 05:28:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:31,935 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 856 transitions. [2025-03-08 05:28:31,936 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 856 transitions. [2025-03-08 05:28:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:28:31,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:31,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:31,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:28:31,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:31,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash 648584653, now seen corresponding path program 1 times [2025-03-08 05:28:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416162999] [2025-03-08 05:28:31,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:31,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:28:31,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:28:31,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:31,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:32,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:32,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416162999] [2025-03-08 05:28:32,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416162999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:32,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:32,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521353395] [2025-03-08 05:28:32,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:32,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:32,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:32,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:32,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:32,135 INFO L87 Difference]: Start difference. First operand 507 states and 856 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:32,207 INFO L93 Difference]: Finished difference Result 996 states and 1689 transitions. [2025-03-08 05:28:32,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:32,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2025-03-08 05:28:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:32,213 INFO L225 Difference]: With dead ends: 996 [2025-03-08 05:28:32,214 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 05:28:32,216 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:28:32,217 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 4 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:32,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2531 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 05:28:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 05:28:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 404 states have (on average 1.7178217821782178) internal successors, (694), 423 states have internal predecessors, (694), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 855 transitions. [2025-03-08 05:28:32,258 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 855 transitions. Word has length 78 [2025-03-08 05:28:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:32,258 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 855 transitions. [2025-03-08 05:28:32,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 855 transitions. [2025-03-08 05:28:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:28:32,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:32,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:32,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:28:32,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:32,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash 856682488, now seen corresponding path program 1 times [2025-03-08 05:28:32,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:32,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596876848] [2025-03-08 05:28:32,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:32,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:28:32,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:28:32,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:32,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:32,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596876848] [2025-03-08 05:28:32,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596876848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:32,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:32,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:32,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753640539] [2025-03-08 05:28:32,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:32,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:32,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:32,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:32,412 INFO L87 Difference]: Start difference. First operand 507 states and 855 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:32,483 INFO L93 Difference]: Finished difference Result 996 states and 1688 transitions. [2025-03-08 05:28:32,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:32,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 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:28:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:32,489 INFO L225 Difference]: With dead ends: 996 [2025-03-08 05:28:32,490 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 05:28:32,492 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:28:32,493 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 3 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2531 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:28:32,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2531 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 05:28:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 05:28:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 404 states have (on average 1.7153465346534653) internal successors, (693), 423 states have internal predecessors, (693), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 854 transitions. [2025-03-08 05:28:32,518 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 854 transitions. Word has length 79 [2025-03-08 05:28:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:32,519 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 854 transitions. [2025-03-08 05:28:32,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 854 transitions. [2025-03-08 05:28:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:28:32,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:32,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:32,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:28:32,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:32,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash 754141936, now seen corresponding path program 1 times [2025-03-08 05:28:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251332299] [2025-03-08 05:28:32,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:32,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:28:32,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:28:32,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:32,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:32,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:32,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251332299] [2025-03-08 05:28:32,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251332299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:32,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:32,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:32,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772128289] [2025-03-08 05:28:32,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:32,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:32,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:32,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:32,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:32,641 INFO L87 Difference]: Start difference. First operand 507 states and 854 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:32,677 INFO L93 Difference]: Finished difference Result 996 states and 1687 transitions. [2025-03-08 05:28:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:32,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-03-08 05:28:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:32,682 INFO L225 Difference]: With dead ends: 996 [2025-03-08 05:28:32,682 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 05:28:32,684 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:28:32,684 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 2 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:32,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2531 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 05:28:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 05:28:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 404 states have (on average 1.7128712871287128) internal successors, (692), 423 states have internal predecessors, (692), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 853 transitions. [2025-03-08 05:28:32,703 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 853 transitions. Word has length 80 [2025-03-08 05:28:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:32,703 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 853 transitions. [2025-03-08 05:28:32,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 853 transitions. [2025-03-08 05:28:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:28:32,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:32,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:32,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:28:32,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:32,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:32,708 INFO L85 PathProgramCache]: Analyzing trace with hash -388254021, now seen corresponding path program 1 times [2025-03-08 05:28:32,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:32,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861987691] [2025-03-08 05:28:32,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:32,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:32,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:28:32,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:28:32,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:32,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861987691] [2025-03-08 05:28:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861987691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:32,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507371002] [2025-03-08 05:28:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:32,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:32,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:32,820 INFO L87 Difference]: Start difference. First operand 507 states and 853 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:32,856 INFO L93 Difference]: Finished difference Result 996 states and 1686 transitions. [2025-03-08 05:28:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-03-08 05:28:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:32,861 INFO L225 Difference]: With dead ends: 996 [2025-03-08 05:28:32,861 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 05:28:32,863 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:28:32,864 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 1 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:32,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2531 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 05:28:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 05:28:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 404 states have (on average 1.7103960396039604) internal successors, (691), 423 states have internal predecessors, (691), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 852 transitions. [2025-03-08 05:28:32,890 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 852 transitions. Word has length 81 [2025-03-08 05:28:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:32,890 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 852 transitions. [2025-03-08 05:28:32,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 852 transitions. [2025-03-08 05:28:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:28:32,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:32,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:32,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:28:32,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:32,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:32,893 INFO L85 PathProgramCache]: Analyzing trace with hash 593570835, now seen corresponding path program 1 times [2025-03-08 05:28:32,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:32,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887681080] [2025-03-08 05:28:32,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:32,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:32,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:28:32,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:28:32,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:32,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:33,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:33,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887681080] [2025-03-08 05:28:33,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887681080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:33,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:33,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:28:33,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101209655] [2025-03-08 05:28:33,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:33,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:28:33,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:33,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:28:33,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:33,127 INFO L87 Difference]: Start difference. First operand 507 states and 852 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:33,240 INFO L93 Difference]: Finished difference Result 962 states and 1618 transitions. [2025-03-08 05:28:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:28:33,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 82 [2025-03-08 05:28:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:33,246 INFO L225 Difference]: With dead ends: 962 [2025-03-08 05:28:33,246 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:28:33,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:33,249 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 91 mSDsluCounter, 5797 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6637 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:33,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6637 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:28:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2025-03-08 05:28:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 414 states have (on average 1.7053140096618358) internal successors, (706), 435 states have internal predecessors, (706), 84 states have call successors, (84), 20 states have call predecessors, (84), 21 states have return successors, (81), 77 states have call predecessors, (81), 79 states have call successors, (81) [2025-03-08 05:28:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 871 transitions. [2025-03-08 05:28:33,277 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 871 transitions. Word has length 82 [2025-03-08 05:28:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:33,278 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 871 transitions. [2025-03-08 05:28:33,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 871 transitions. [2025-03-08 05:28:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:28:33,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:33,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:33,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:28:33,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:33,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1897964564, now seen corresponding path program 1 times [2025-03-08 05:28:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:33,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044654720] [2025-03-08 05:28:33,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:33,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:28:33,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:28:33,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:33,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:33,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044654720] [2025-03-08 05:28:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044654720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:33,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:33,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:33,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795689662] [2025-03-08 05:28:33,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:33,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:33,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:33,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:33,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:33,370 INFO L87 Difference]: Start difference. First operand 520 states and 871 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:33,407 INFO L93 Difference]: Finished difference Result 1014 states and 1712 transitions. [2025-03-08 05:28:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 82 [2025-03-08 05:28:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:33,412 INFO L225 Difference]: With dead ends: 1014 [2025-03-08 05:28:33,412 INFO L226 Difference]: Without dead ends: 501 [2025-03-08 05:28:33,414 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:28:33,414 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:33,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2533 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-08 05:28:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2025-03-08 05:28:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 398 states have (on average 1.7010050251256281) internal successors, (677), 417 states have internal predecessors, (677), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 838 transitions. [2025-03-08 05:28:33,434 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 838 transitions. Word has length 82 [2025-03-08 05:28:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:33,435 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 838 transitions. [2025-03-08 05:28:33,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 838 transitions. [2025-03-08 05:28:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:28:33,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:33,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:33,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:28:33,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:33,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1240674050, now seen corresponding path program 1 times [2025-03-08 05:28:33,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:33,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339761091] [2025-03-08 05:28:33,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:33,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:28:33,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:28:33,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:33,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:33,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:33,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339761091] [2025-03-08 05:28:33,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339761091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:33,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:33,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:33,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579428678] [2025-03-08 05:28:33,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:33,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:33,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:33,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:33,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:33,578 INFO L87 Difference]: Start difference. First operand 501 states and 838 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:33,745 INFO L93 Difference]: Finished difference Result 959 states and 1610 transitions. [2025-03-08 05:28:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:33,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2025-03-08 05:28:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:33,750 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:28:33,750 INFO L226 Difference]: Without dead ends: 510 [2025-03-08 05:28:33,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:33,753 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 55 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 3946 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:33,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 3946 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-08 05:28:33,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 501. [2025-03-08 05:28:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 398 states have (on average 1.6909547738693467) internal successors, (673), 417 states have internal predecessors, (673), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 834 transitions. [2025-03-08 05:28:33,770 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 834 transitions. Word has length 83 [2025-03-08 05:28:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:33,770 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 834 transitions. [2025-03-08 05:28:33,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:33,770 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 834 transitions. [2025-03-08 05:28:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:28:33,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:33,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:33,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:28:33,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:33,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash -444868548, now seen corresponding path program 1 times [2025-03-08 05:28:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:33,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668863938] [2025-03-08 05:28:33,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:33,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:33,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:28:33,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:28:33,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:33,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:33,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668863938] [2025-03-08 05:28:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668863938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:33,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:33,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129258615] [2025-03-08 05:28:33,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:33,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:33,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:33,912 INFO L87 Difference]: Start difference. First operand 501 states and 834 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:34,067 INFO L93 Difference]: Finished difference Result 959 states and 1606 transitions. [2025-03-08 05:28:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-08 05:28:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:34,071 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:28:34,071 INFO L226 Difference]: Without dead ends: 510 [2025-03-08 05:28:34,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:34,074 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 54 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3946 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:34,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3946 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-08 05:28:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 501. [2025-03-08 05:28:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 398 states have (on average 1.6809045226130652) internal successors, (669), 417 states have internal predecessors, (669), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 830 transitions. [2025-03-08 05:28:34,094 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 830 transitions. Word has length 84 [2025-03-08 05:28:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:34,096 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 830 transitions. [2025-03-08 05:28:34,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 830 transitions. [2025-03-08 05:28:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:28:34,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:34,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:34,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:28:34,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:34,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:34,099 INFO L85 PathProgramCache]: Analyzing trace with hash 646566879, now seen corresponding path program 1 times [2025-03-08 05:28:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:34,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902220374] [2025-03-08 05:28:34,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:34,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:34,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:28:34,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:28:34,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:34,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:34,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:34,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902220374] [2025-03-08 05:28:34,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902220374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:34,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:34,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:34,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543661622] [2025-03-08 05:28:34,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:34,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:34,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:34,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:34,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:34,226 INFO L87 Difference]: Start difference. First operand 501 states and 830 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:34,358 INFO L93 Difference]: Finished difference Result 959 states and 1602 transitions. [2025-03-08 05:28:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:34,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-03-08 05:28:34,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:34,363 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:28:34,363 INFO L226 Difference]: Without dead ends: 510 [2025-03-08 05:28:34,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:34,366 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 53 mSDsluCounter, 3134 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3928 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:34,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3928 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-08 05:28:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 501. [2025-03-08 05:28:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 398 states have (on average 1.670854271356784) internal successors, (665), 417 states have internal predecessors, (665), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 826 transitions. [2025-03-08 05:28:34,407 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 826 transitions. Word has length 85 [2025-03-08 05:28:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:34,407 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 826 transitions. [2025-03-08 05:28:34,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 826 transitions. [2025-03-08 05:28:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:28:34,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:34,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:34,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:28:34,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:34,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:34,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1782832016, now seen corresponding path program 1 times [2025-03-08 05:28:34,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:34,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108637120] [2025-03-08 05:28:34,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:34,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:34,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:28:34,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:28:34,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:34,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108637120] [2025-03-08 05:28:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108637120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:34,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:34,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:34,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897836716] [2025-03-08 05:28:34,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:34,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:34,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:34,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:34,521 INFO L87 Difference]: Start difference. First operand 501 states and 826 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:34,579 INFO L93 Difference]: Finished difference Result 950 states and 1584 transitions. [2025-03-08 05:28:34,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:28:34,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 85 [2025-03-08 05:28:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:34,583 INFO L225 Difference]: With dead ends: 950 [2025-03-08 05:28:34,583 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:28:34,585 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:28:34,586 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 84 mSDsluCounter, 4002 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4817 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:34,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4817 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:28:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:28:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 377 states have (on average 1.6737400530503979) internal successors, (631), 396 states have internal predecessors, (631), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 792 transitions. [2025-03-08 05:28:34,600 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 792 transitions. Word has length 85 [2025-03-08 05:28:34,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:34,600 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 792 transitions. [2025-03-08 05:28:34,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 792 transitions. [2025-03-08 05:28:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:28:34,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:34,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:34,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:28:34,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:34,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:34,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1924975161, now seen corresponding path program 1 times [2025-03-08 05:28:34,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:34,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598357144] [2025-03-08 05:28:34,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:34,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:34,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:28:34,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:28:34,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:34,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:34,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:34,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598357144] [2025-03-08 05:28:34,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598357144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:34,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:34,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:34,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816766869] [2025-03-08 05:28:34,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:34,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:34,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:34,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:34,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:34,720 INFO L87 Difference]: Start difference. First operand 480 states and 792 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:34,783 INFO L93 Difference]: Finished difference Result 929 states and 1550 transitions. [2025-03-08 05:28:34,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:34,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-03-08 05:28:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:34,788 INFO L225 Difference]: With dead ends: 929 [2025-03-08 05:28:34,788 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:28:34,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:34,790 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 17 mSDsluCounter, 3091 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3866 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:34,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3866 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:28:34,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:28:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 377 states have (on average 1.6710875331564987) internal successors, (630), 396 states have internal predecessors, (630), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 791 transitions. [2025-03-08 05:28:34,806 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 791 transitions. Word has length 86 [2025-03-08 05:28:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:34,806 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 791 transitions. [2025-03-08 05:28:34,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 791 transitions. [2025-03-08 05:28:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:28:34,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:34,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:34,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:28:34,809 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:34,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:34,809 INFO L85 PathProgramCache]: Analyzing trace with hash 409607356, now seen corresponding path program 1 times [2025-03-08 05:28:34,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:34,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996178678] [2025-03-08 05:28:34,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:34,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:34,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:28:34,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:28:34,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:34,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:34,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:34,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996178678] [2025-03-08 05:28:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996178678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:34,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:34,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219483983] [2025-03-08 05:28:34,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:34,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:34,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:34,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:34,924 INFO L87 Difference]: Start difference. First operand 480 states and 791 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:34,978 INFO L93 Difference]: Finished difference Result 929 states and 1549 transitions. [2025-03-08 05:28:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:34,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2025-03-08 05:28:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:34,982 INFO L225 Difference]: With dead ends: 929 [2025-03-08 05:28:34,983 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:28:34,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:34,985 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 16 mSDsluCounter, 3091 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3866 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:34,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3866 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:28:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:28:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 377 states have (on average 1.6684350132625996) internal successors, (629), 396 states have internal predecessors, (629), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 790 transitions. [2025-03-08 05:28:34,998 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 790 transitions. Word has length 87 [2025-03-08 05:28:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:34,999 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 790 transitions. [2025-03-08 05:28:34,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 790 transitions. [2025-03-08 05:28:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 05:28:35,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:35,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:35,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:28:35,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:35,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:35,002 INFO L85 PathProgramCache]: Analyzing trace with hash 550874965, now seen corresponding path program 1 times [2025-03-08 05:28:35,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:35,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966387842] [2025-03-08 05:28:35,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:35,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:35,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 05:28:35,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 05:28:35,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:35,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:35,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:35,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966387842] [2025-03-08 05:28:35,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966387842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:35,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:35,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568818459] [2025-03-08 05:28:35,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:35,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:35,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:35,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:35,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:35,067 INFO L87 Difference]: Start difference. First operand 480 states and 790 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:35,094 INFO L93 Difference]: Finished difference Result 929 states and 1548 transitions. [2025-03-08 05:28:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:35,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-03-08 05:28:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:35,098 INFO L225 Difference]: With dead ends: 929 [2025-03-08 05:28:35,098 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:28:35,100 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:28:35,100 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 9 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:35,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2343 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:28:35,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:28:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 377 states have (on average 1.6657824933687002) internal successors, (628), 396 states have internal predecessors, (628), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 789 transitions. [2025-03-08 05:28:35,131 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 789 transitions. Word has length 88 [2025-03-08 05:28:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:35,133 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 789 transitions. [2025-03-08 05:28:35,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 789 transitions. [2025-03-08 05:28:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 05:28:35,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:35,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:35,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:28:35,136 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:35,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:35,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1813473226, now seen corresponding path program 1 times [2025-03-08 05:28:35,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:35,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863161744] [2025-03-08 05:28:35,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:35,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 05:28:35,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 05:28:35,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:35,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:35,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:35,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863161744] [2025-03-08 05:28:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863161744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:35,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:35,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:28:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338339143] [2025-03-08 05:28:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:35,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:28:35,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:35,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:28:35,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:35,297 INFO L87 Difference]: Start difference. First operand 480 states and 789 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:35,378 INFO L93 Difference]: Finished difference Result 923 states and 1536 transitions. [2025-03-08 05:28:35,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:28:35,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 88 [2025-03-08 05:28:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:35,383 INFO L225 Difference]: With dead ends: 923 [2025-03-08 05:28:35,383 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:28:35,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:35,385 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 5 mSDsluCounter, 6163 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6936 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:35,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6936 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:28:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:28:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 377 states have (on average 1.663129973474801) internal successors, (627), 396 states have internal predecessors, (627), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 05:28:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 788 transitions. [2025-03-08 05:28:35,399 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 788 transitions. Word has length 88 [2025-03-08 05:28:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:35,400 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 788 transitions. [2025-03-08 05:28:35,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 788 transitions. [2025-03-08 05:28:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 05:28:35,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:35,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:35,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:28:35,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:35,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:35,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1225707369, now seen corresponding path program 1 times [2025-03-08 05:28:35,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:35,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803630258] [2025-03-08 05:28:35,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:35,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:35,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:28:35,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:28:35,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:35,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:35,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:35,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803630258] [2025-03-08 05:28:35,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803630258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:35,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:35,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:28:35,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989713462] [2025-03-08 05:28:35,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:35,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:28:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:35,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:28:35,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:28:35,573 INFO L87 Difference]: Start difference. First operand 480 states and 788 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:36,830 INFO L93 Difference]: Finished difference Result 919 states and 1548 transitions. [2025-03-08 05:28:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:36,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 89 [2025-03-08 05:28:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:36,835 INFO L225 Difference]: With dead ends: 919 [2025-03-08 05:28:36,835 INFO L226 Difference]: Without dead ends: 484 [2025-03-08 05:28:36,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:28:36,837 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1220 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 2770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:36,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 1530 Invalid, 2770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 05:28:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-08 05:28:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-03-08 05:28:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 380 states have (on average 1.6578947368421053) internal successors, (630), 399 states have internal predecessors, (630), 83 states have call successors, (83), 20 states have call predecessors, (83), 20 states have return successors, (94), 77 states have call predecessors, (94), 78 states have call successors, (94) [2025-03-08 05:28:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 807 transitions. [2025-03-08 05:28:36,857 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 807 transitions. Word has length 89 [2025-03-08 05:28:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:36,857 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 807 transitions. [2025-03-08 05:28:36,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 807 transitions. [2025-03-08 05:28:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:28:36,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:36,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:36,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:28:36,859 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:36,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2010218212, now seen corresponding path program 1 times [2025-03-08 05:28:36,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:36,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284859046] [2025-03-08 05:28:36,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:36,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:36,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:28:36,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:28:36,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:36,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:36,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:36,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284859046] [2025-03-08 05:28:36,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284859046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:36,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:36,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:36,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636105789] [2025-03-08 05:28:36,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:36,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:36,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:36,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:36,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:36,963 INFO L87 Difference]: Start difference. First operand 484 states and 807 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:39,478 INFO L93 Difference]: Finished difference Result 1704 states and 2940 transitions. [2025-03-08 05:28:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:28:39,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 90 [2025-03-08 05:28:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:39,488 INFO L225 Difference]: With dead ends: 1704 [2025-03-08 05:28:39,488 INFO L226 Difference]: Without dead ends: 1265 [2025-03-08 05:28:39,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:28:39,492 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 2202 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 4363 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 4914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 4363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:39,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2261 Valid, 2333 Invalid, 4914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 4363 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 05:28:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2025-03-08 05:28:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1206. [2025-03-08 05:28:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 944 states have (on average 1.6726694915254237) internal successors, (1579), 992 states have internal predecessors, (1579), 210 states have call successors, (210), 51 states have call predecessors, (210), 51 states have return successors, (225), 199 states have call predecessors, (225), 205 states have call successors, (225) [2025-03-08 05:28:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2014 transitions. [2025-03-08 05:28:39,579 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2014 transitions. Word has length 90 [2025-03-08 05:28:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:39,579 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 2014 transitions. [2025-03-08 05:28:39,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2014 transitions. [2025-03-08 05:28:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:28:39,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:39,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:39,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:28:39,581 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:39,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:39,581 INFO L85 PathProgramCache]: Analyzing trace with hash 324100396, now seen corresponding path program 1 times [2025-03-08 05:28:39,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:39,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111595498] [2025-03-08 05:28:39,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:39,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:39,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:28:39,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:28:39,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:39,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:39,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:39,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111595498] [2025-03-08 05:28:39,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111595498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:39,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:39,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:39,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830287426] [2025-03-08 05:28:39,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:39,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:39,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:39,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:39,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:39,713 INFO L87 Difference]: Start difference. First operand 1206 states and 2014 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:42,437 INFO L93 Difference]: Finished difference Result 5588 states and 9647 transitions. [2025-03-08 05:28:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:28:42,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 92 [2025-03-08 05:28:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:42,465 INFO L225 Difference]: With dead ends: 5588 [2025-03-08 05:28:42,466 INFO L226 Difference]: Without dead ends: 4427 [2025-03-08 05:28:42,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:28:42,474 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 2931 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 5086 mSolverCounterSat, 769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 5855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 5086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:42,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3048 Valid, 2602 Invalid, 5855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [769 Valid, 5086 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 05:28:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2025-03-08 05:28:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 3950. [2025-03-08 05:28:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3950 states, 2919 states have (on average 1.6666666666666667) internal successors, (4865), 3131 states have internal predecessors, (4865), 877 states have call successors, (877), 137 states have call predecessors, (877), 153 states have return successors, (1071), 855 states have call predecessors, (1071), 872 states have call successors, (1071) [2025-03-08 05:28:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 6813 transitions. [2025-03-08 05:28:42,703 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 6813 transitions. Word has length 92 [2025-03-08 05:28:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:42,705 INFO L471 AbstractCegarLoop]: Abstraction has 3950 states and 6813 transitions. [2025-03-08 05:28:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 6813 transitions. [2025-03-08 05:28:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:28:42,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:42,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:42,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:28:42,708 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:42,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1047706902, now seen corresponding path program 1 times [2025-03-08 05:28:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031646531] [2025-03-08 05:28:42,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:42,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:28:42,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:28:42,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:42,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031646531] [2025-03-08 05:28:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031646531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:42,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:42,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:42,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601422062] [2025-03-08 05:28:42,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:42,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:42,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:42,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:42,821 INFO L87 Difference]: Start difference. First operand 3950 states and 6813 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:44,716 INFO L93 Difference]: Finished difference Result 10473 states and 18181 transitions. [2025-03-08 05:28:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:28:44,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 92 [2025-03-08 05:28:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:44,769 INFO L225 Difference]: With dead ends: 10473 [2025-03-08 05:28:44,769 INFO L226 Difference]: Without dead ends: 7613 [2025-03-08 05:28:44,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:28:44,787 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 2198 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 3383 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2263 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 3829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 3383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:44,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2263 Valid, 1670 Invalid, 3829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 3383 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 05:28:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7613 states. [2025-03-08 05:28:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7613 to 7316. [2025-03-08 05:28:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7316 states, 5446 states have (on average 1.663973558575101) internal successors, (9062), 5836 states have internal predecessors, (9062), 1557 states have call successors, (1557), 254 states have call predecessors, (1557), 312 states have return successors, (2030), 1516 states have call predecessors, (2030), 1552 states have call successors, (2030) [2025-03-08 05:28:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7316 states to 7316 states and 12649 transitions. [2025-03-08 05:28:45,174 INFO L78 Accepts]: Start accepts. Automaton has 7316 states and 12649 transitions. Word has length 92 [2025-03-08 05:28:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:45,174 INFO L471 AbstractCegarLoop]: Abstraction has 7316 states and 12649 transitions. [2025-03-08 05:28:45,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7316 states and 12649 transitions. [2025-03-08 05:28:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:28:45,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:45,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:45,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:28:45,177 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:45,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash -879640286, now seen corresponding path program 1 times [2025-03-08 05:28:45,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:45,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705751601] [2025-03-08 05:28:45,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:45,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:28:45,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:28:45,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:45,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:45,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:45,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705751601] [2025-03-08 05:28:45,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705751601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:45,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:45,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:28:45,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453142283] [2025-03-08 05:28:45,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:45,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:28:45,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:45,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:28:45,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:45,289 INFO L87 Difference]: Start difference. First operand 7316 states and 12649 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:28:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:45,594 INFO L93 Difference]: Finished difference Result 13464 states and 23341 transitions. [2025-03-08 05:28:45,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:45,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2025-03-08 05:28:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:45,651 INFO L225 Difference]: With dead ends: 13464 [2025-03-08 05:28:45,651 INFO L226 Difference]: Without dead ends: 7403 [2025-03-08 05:28:45,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:45,674 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 0 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3114 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:45,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3114 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7403 states. [2025-03-08 05:28:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7403 to 7389. [2025-03-08 05:28:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7389 states, 5502 states have (on average 1.6566703017084696) internal successors, (9115), 5891 states have internal predecessors, (9115), 1554 states have call successors, (1554), 254 states have call predecessors, (1554), 332 states have return successors, (2093), 1534 states have call predecessors, (2093), 1549 states have call successors, (2093) [2025-03-08 05:28:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 12762 transitions. [2025-03-08 05:28:46,116 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 12762 transitions. Word has length 97 [2025-03-08 05:28:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:46,116 INFO L471 AbstractCegarLoop]: Abstraction has 7389 states and 12762 transitions. [2025-03-08 05:28:46,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:28:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 12762 transitions. [2025-03-08 05:28:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:28:46,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:46,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:46,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:28:46,120 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:46,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:46,120 INFO L85 PathProgramCache]: Analyzing trace with hash 440084707, now seen corresponding path program 1 times [2025-03-08 05:28:46,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:46,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078407606] [2025-03-08 05:28:46,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:46,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:46,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:28:46,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:28:46,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:46,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:46,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:46,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078407606] [2025-03-08 05:28:46,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078407606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:46,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:46,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:46,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948404190] [2025-03-08 05:28:46,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:46,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:46,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:46,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:46,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:46,243 INFO L87 Difference]: Start difference. First operand 7389 states and 12762 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:28:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:46,687 INFO L93 Difference]: Finished difference Result 14690 states and 25814 transitions. [2025-03-08 05:28:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:46,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2025-03-08 05:28:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:46,725 INFO L225 Difference]: With dead ends: 14690 [2025-03-08 05:28:46,726 INFO L226 Difference]: Without dead ends: 7537 [2025-03-08 05:28:46,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:46,747 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 225 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3887 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:46,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3887 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7537 states. [2025-03-08 05:28:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7537 to 7413. [2025-03-08 05:28:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7413 states, 5523 states have (on average 1.632446134347275) internal successors, (9016), 5915 states have internal predecessors, (9016), 1554 states have call successors, (1554), 254 states have call predecessors, (1554), 335 states have return successors, (2105), 1534 states have call predecessors, (2105), 1549 states have call successors, (2105) [2025-03-08 05:28:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7413 states to 7413 states and 12675 transitions. [2025-03-08 05:28:47,011 INFO L78 Accepts]: Start accepts. Automaton has 7413 states and 12675 transitions. Word has length 104 [2025-03-08 05:28:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:47,011 INFO L471 AbstractCegarLoop]: Abstraction has 7413 states and 12675 transitions. [2025-03-08 05:28:47,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:28:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 7413 states and 12675 transitions. [2025-03-08 05:28:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:28:47,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:47,013 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, 1, 1, 1, 1, 1, 1, 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:47,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:28:47,014 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash -705189480, now seen corresponding path program 1 times [2025-03-08 05:28:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603704821] [2025-03-08 05:28:47,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:47,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:28:47,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:28:47,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:47,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:28:47,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:47,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603704821] [2025-03-08 05:28:47,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603704821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:47,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:47,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:47,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059000] [2025-03-08 05:28:47,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:47,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:47,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:47,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:47,163 INFO L87 Difference]: Start difference. First operand 7413 states and 12675 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:28:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:48,912 INFO L93 Difference]: Finished difference Result 14101 states and 24145 transitions. [2025-03-08 05:28:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:28:48,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 109 [2025-03-08 05:28:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:48,949 INFO L225 Difference]: With dead ends: 14101 [2025-03-08 05:28:48,949 INFO L226 Difference]: Without dead ends: 7959 [2025-03-08 05:28:48,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:28:48,965 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1946 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2013 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:48,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2013 Valid, 1485 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2910 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 05:28:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states. [2025-03-08 05:28:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7644. [2025-03-08 05:28:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7644 states, 5696 states have (on average 1.6206109550561798) internal successors, (9231), 6106 states have internal predecessors, (9231), 1571 states have call successors, (1571), 280 states have call predecessors, (1571), 376 states have return successors, (2194), 1548 states have call predecessors, (2194), 1566 states have call successors, (2194) [2025-03-08 05:28:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 12996 transitions. [2025-03-08 05:28:49,251 INFO L78 Accepts]: Start accepts. Automaton has 7644 states and 12996 transitions. Word has length 109 [2025-03-08 05:28:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:49,251 INFO L471 AbstractCegarLoop]: Abstraction has 7644 states and 12996 transitions. [2025-03-08 05:28:49,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:28:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 7644 states and 12996 transitions. [2025-03-08 05:28:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:28:49,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:49,255 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, 1, 1, 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:49,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:28:49,255 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:49,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1739687997, now seen corresponding path program 1 times [2025-03-08 05:28:49,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:49,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756872260] [2025-03-08 05:28:49,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:49,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:49,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:28:49,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:28:49,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:49,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:28:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756872260] [2025-03-08 05:28:49,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756872260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:49,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:49,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:28:49,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77618805] [2025-03-08 05:28:49,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:49,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:28:49,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:49,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:28:49,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:49,344 INFO L87 Difference]: Start difference. First operand 7644 states and 12996 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:28:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:49,934 INFO L93 Difference]: Finished difference Result 17266 states and 29504 transitions. [2025-03-08 05:28:49,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:49,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-08 05:28:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:50,002 INFO L225 Difference]: With dead ends: 17266 [2025-03-08 05:28:50,002 INFO L226 Difference]: Without dead ends: 10893 [2025-03-08 05:28:50,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:50,037 INFO L435 NwaCegarLoop]: 1279 mSDtfsCounter, 720 mSDsluCounter, 3311 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 4590 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:50,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 4590 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10893 states. [2025-03-08 05:28:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10893 to 10219. [2025-03-08 05:28:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10219 states, 7614 states have (on average 1.630942999737326) internal successors, (12418), 8151 states have internal predecessors, (12418), 2128 states have call successors, (2128), 361 states have call predecessors, (2128), 476 states have return successors, (2907), 2114 states have call predecessors, (2907), 2123 states have call successors, (2907) [2025-03-08 05:28:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10219 states to 10219 states and 17453 transitions. [2025-03-08 05:28:50,572 INFO L78 Accepts]: Start accepts. Automaton has 10219 states and 17453 transitions. Word has length 114 [2025-03-08 05:28:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:50,572 INFO L471 AbstractCegarLoop]: Abstraction has 10219 states and 17453 transitions. [2025-03-08 05:28:50,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:28:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 10219 states and 17453 transitions. [2025-03-08 05:28:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:28:50,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:50,575 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, 1, 1, 1, 1, 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:50,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:28:50,576 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:50,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1083068428, now seen corresponding path program 1 times [2025-03-08 05:28:50,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:50,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584267831] [2025-03-08 05:28:50,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:50,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:28:50,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:28:50,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:50,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:28:50,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584267831] [2025-03-08 05:28:50,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584267831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:50,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:28:50,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600514635] [2025-03-08 05:28:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:50,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:28:50,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:50,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:28:50,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:50,766 INFO L87 Difference]: Start difference. First operand 10219 states and 17453 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 05:28:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:53,390 INFO L93 Difference]: Finished difference Result 21886 states and 37047 transitions. [2025-03-08 05:28:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:28:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2025-03-08 05:28:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:53,454 INFO L225 Difference]: With dead ends: 21886 [2025-03-08 05:28:53,455 INFO L226 Difference]: Without dead ends: 12757 [2025-03-08 05:28:53,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:28:53,485 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 1959 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 6521 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2030 SdHoareTripleChecker+Valid, 2937 SdHoareTripleChecker+Invalid, 6911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 6521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:53,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2030 Valid, 2937 Invalid, 6911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 6521 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 05:28:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12757 states. [2025-03-08 05:28:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12757 to 11815. [2025-03-08 05:28:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11815 states, 8882 states have (on average 1.6098851609997749) internal successors, (14299), 9484 states have internal predecessors, (14299), 2319 states have call successors, (2319), 450 states have call predecessors, (2319), 613 states have return successors, (3206), 2282 states have call predecessors, (3206), 2314 states have call successors, (3206) [2025-03-08 05:28:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11815 states to 11815 states and 19824 transitions. [2025-03-08 05:28:53,918 INFO L78 Accepts]: Start accepts. Automaton has 11815 states and 19824 transitions. Word has length 116 [2025-03-08 05:28:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:53,919 INFO L471 AbstractCegarLoop]: Abstraction has 11815 states and 19824 transitions. [2025-03-08 05:28:53,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 05:28:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 11815 states and 19824 transitions. [2025-03-08 05:28:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:28:53,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:53,922 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, 1, 1, 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:53,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:28:53,922 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:53,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1672681244, now seen corresponding path program 1 times [2025-03-08 05:28:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199752662] [2025-03-08 05:28:53,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:53,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:28:53,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:28:53,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:53,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:28:54,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:54,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199752662] [2025-03-08 05:28:54,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199752662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:54,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:54,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:28:54,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939683326] [2025-03-08 05:28:54,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:54,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:28:54,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:54,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:28:54,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:54,123 INFO L87 Difference]: Start difference. First operand 11815 states and 19824 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:28:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:57,536 INFO L93 Difference]: Finished difference Result 41165 states and 71744 transitions. [2025-03-08 05:28:57,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:28:57,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2025-03-08 05:28:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:57,796 INFO L225 Difference]: With dead ends: 41165 [2025-03-08 05:28:57,796 INFO L226 Difference]: Without dead ends: 29395 [2025-03-08 05:28:57,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:28:57,887 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 3789 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 4318 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3824 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 5466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 4318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:57,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3824 Valid, 2544 Invalid, 5466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 4318 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 05:28:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29395 states. [2025-03-08 05:28:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29395 to 29202. [2025-03-08 05:28:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29202 states, 20610 states have (on average 1.5856865599223677) internal successors, (32681), 22413 states have internal predecessors, (32681), 7281 states have call successors, (7281), 895 states have call predecessors, (7281), 1310 states have return successors, (10360), 7257 states have call predecessors, (10360), 7276 states have call successors, (10360) [2025-03-08 05:28:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29202 states to 29202 states and 50322 transitions. [2025-03-08 05:28:59,358 INFO L78 Accepts]: Start accepts. Automaton has 29202 states and 50322 transitions. Word has length 114 [2025-03-08 05:28:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:59,359 INFO L471 AbstractCegarLoop]: Abstraction has 29202 states and 50322 transitions. [2025-03-08 05:28:59,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:28:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 29202 states and 50322 transitions. [2025-03-08 05:28:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:28:59,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:59,361 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, 1, 1, 1, 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:59,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:28:59,361 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:59,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash -835507896, now seen corresponding path program 1 times [2025-03-08 05:28:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:59,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840388225] [2025-03-08 05:28:59,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:59,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:59,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:28:59,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:28:59,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:59,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:28:59,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:59,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840388225] [2025-03-08 05:28:59,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840388225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:59,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:59,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:28:59,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277204924] [2025-03-08 05:28:59,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:59,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:28:59,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:59,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:28:59,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:59,480 INFO L87 Difference]: Start difference. First operand 29202 states and 50322 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:29:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:05,960 INFO L93 Difference]: Finished difference Result 108851 states and 195823 transitions. [2025-03-08 05:29:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:29:05,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 115 [2025-03-08 05:29:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:06,585 INFO L225 Difference]: With dead ends: 108851 [2025-03-08 05:29:06,585 INFO L226 Difference]: Without dead ends: 79694 [2025-03-08 05:29:06,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:29:06,772 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 3051 mSDsluCounter, 2266 mSDsCounter, 0 mSdLazyCounter, 5475 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3086 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 6350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 5475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:06,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3086 Valid, 3049 Invalid, 6350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 5475 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 05:29:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79694 states. [2025-03-08 05:29:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79694 to 79325. [2025-03-08 05:29:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79325 states, 52102 states have (on average 1.5598057656136042) internal successors, (81269), 57735 states have internal predecessors, (81269), 24366 states have call successors, (24366), 1785 states have call predecessors, (24366), 2856 states have return successors, (36208), 24534 states have call predecessors, (36208), 24361 states have call successors, (36208) [2025-03-08 05:29:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79325 states to 79325 states and 141843 transitions. [2025-03-08 05:29:12,907 INFO L78 Accepts]: Start accepts. Automaton has 79325 states and 141843 transitions. Word has length 115 [2025-03-08 05:29:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:12,907 INFO L471 AbstractCegarLoop]: Abstraction has 79325 states and 141843 transitions. [2025-03-08 05:29:12,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:29:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 79325 states and 141843 transitions. [2025-03-08 05:29:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:29:12,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:12,910 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, 1, 1, 1, 1, 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:29:12,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 05:29:12,910 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:12,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2067494495, now seen corresponding path program 1 times [2025-03-08 05:29:12,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64922840] [2025-03-08 05:29:12,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:12,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:29:12,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:29:12,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:12,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:29:13,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:13,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64922840] [2025-03-08 05:29:13,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64922840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:13,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:13,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:29:13,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402639895] [2025-03-08 05:29:13,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:13,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:29:13,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:13,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:29:13,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:29:13,052 INFO L87 Difference]: Start difference. First operand 79325 states and 141843 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12)