./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product30.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_product30.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 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:28:51,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:28:51,434 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:51,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:28:51,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:28:51,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:28:51,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:28:51,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:28:51,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:28:51,463 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:28:51,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:28:51,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:28:51,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:28:51,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:28:51,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:28:51,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:28:51,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:51,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:28:51,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:28:51,466 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 -> 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e [2025-03-08 05:28:51,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:28:51,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:28:51,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:28:51,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:28:51,715 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:28:51,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2025-03-08 05:28:52,842 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e6be04d/257b5e8d84564b1494ae92a2740df5c5/FLAGcd8d5b53b [2025-03-08 05:28:53,128 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:28:53,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2025-03-08 05:28:53,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e6be04d/257b5e8d84564b1494ae92a2740df5c5/FLAGcd8d5b53b [2025-03-08 05:28:53,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e6be04d/257b5e8d84564b1494ae92a2740df5c5 [2025-03-08 05:28:53,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:28:53,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:28:53,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:53,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:28:53,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:28:53,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:53" (1/1) ... [2025-03-08 05:28:53,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca01079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:53, skipping insertion in model container [2025-03-08 05:28:53,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:53" (1/1) ... [2025-03-08 05:28:53,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:28:53,651 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_product30.cil.c[11768,11781] [2025-03-08 05:28:53,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:53,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:28:53,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-08 05:28:53,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [414] [2025-03-08 05:28:53,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [452] [2025-03-08 05:28:53,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [461] [2025-03-08 05:28:53,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [626] [2025-03-08 05:28:53,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [640] [2025-03-08 05:28:53,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [739] [2025-03-08 05:28:53,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [859] [2025-03-08 05:28:53,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2444] [2025-03-08 05:28:53,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3105] [2025-03-08 05:28:53,848 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_product30.cil.c[11768,11781] [2025-03-08 05:28:53,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:53,924 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:28:53,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:53 WrapperNode [2025-03-08 05:28:53,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:53,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:53,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:28:53,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:28:53,931 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:53" (1/1) ... [2025-03-08 05:28:53,946 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:53" (1/1) ... [2025-03-08 05:28:53,970 INFO L138 Inliner]: procedures = 95, calls = 344, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 869 [2025-03-08 05:28:53,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:53,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:28:53,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:28:53,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:28:53,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:53" (1/1) ... [2025-03-08 05:28:53,978 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:53" (1/1) ... [2025-03-08 05:28:53,982 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:53" (1/1) ... [2025-03-08 05:28:54,010 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:28:54,011 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:53" (1/1) ... [2025-03-08 05:28:54,011 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:53" (1/1) ... [2025-03-08 05:28:54,025 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:53" (1/1) ... [2025-03-08 05:28:54,027 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:53" (1/1) ... [2025-03-08 05:28:54,030 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:53" (1/1) ... [2025-03-08 05:28:54,031 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:53" (1/1) ... [2025-03-08 05:28:54,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:28:54,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:28:54,041 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:28:54,041 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:28:54,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:53" (1/1) ... [2025-03-08 05:28:54,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:54,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:54,073 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:54,076 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:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:28:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:28:54,094 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:28:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:28:54,094 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:28:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:28:54,094 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:28:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:28:54,094 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:28:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:28:54,094 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:28:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-08 05:28:54,094 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-08 05:28:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:28:54,095 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:28:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:28:54,095 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:28:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:28:54,097 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:28:54,097 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:28:54,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:28:54,097 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:28:54,097 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:28:54,097 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:28:54,097 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:28:54,097 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:28:54,098 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:28:54,098 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:28:54,098 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:28:54,098 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:28:54,098 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:28:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:28:54,099 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:28:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:28:54,099 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:28:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:28:54,099 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:28:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:28:54,099 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:28:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-08 05:28:54,099 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-08 05:28:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:28:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:28:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:28:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:28:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:28:54,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:28:54,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:28:54,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-08 05:28:54,101 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:28:54,101 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:28:54,101 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:28:54,101 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-03-08 05:28:54,101 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-03-08 05:28:54,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:28:54,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:28:54,102 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:28:54,102 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:28:54,233 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:28:54,236 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:28:54,276 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L856: #res := ~retValue_acc~7; [2025-03-08 05:28:54,295 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L778: #res := ~retValue_acc~5; [2025-03-08 05:28:54,298 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: #res := ~retValue_acc~8; [2025-03-08 05:28:54,306 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: #res := ~retValue_acc~9; [2025-03-08 05:28:54,476 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~18#1; [2025-03-08 05:28:54,477 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1690: #res#1 := ~retValue_acc~17#1; [2025-03-08 05:28:54,537 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822: #res := ~retValue_acc~21; [2025-03-08 05:28:54,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: #res := ~retValue_acc~6; [2025-03-08 05:28:54,565 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1206: #res := ~retValue_acc~13; [2025-03-08 05:28:54,678 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1651: #res := ~retValue_acc~16; [2025-03-08 05:28:54,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1157: #res := ~retValue_acc~11; [2025-03-08 05:28:54,819 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1299-1: isIdle_#res#1 := isIdle_~retValue_acc~15#1; [2025-03-08 05:28:54,819 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1286-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; [2025-03-08 05:28:54,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: #res := ~retValue_acc~24; [2025-03-08 05:28:54,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1780-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~19#1; [2025-03-08 05:28:54,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-03-08 05:28:55,001 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3452-1: main_#res#1 := main_~retValue_acc~27#1; [2025-03-08 05:28:55,001 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L449-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-03-08 05:28:55,013 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555: #res := ~retValue_acc~23; [2025-03-08 05:28:55,015 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1123: #res := ~retValue_acc~10; [2025-03-08 05:28:55,018 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3102: #res := ~retValue_acc~25; [2025-03-08 05:28:55,128 INFO L? ?]: Removed 455 outVars from TransFormulas that were not future-live. [2025-03-08 05:28:55,129 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:28:55,151 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:28:55,152 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:28:55,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:55 BoogieIcfgContainer [2025-03-08 05:28:55,152 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:28:55,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:28:55,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:28:55,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:28:55,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:28:53" (1/3) ... [2025-03-08 05:28:55,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3ee7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:55, skipping insertion in model container [2025-03-08 05:28:55,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:53" (2/3) ... [2025-03-08 05:28:55,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3ee7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:55, skipping insertion in model container [2025-03-08 05:28:55,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:55" (3/3) ... [2025-03-08 05:28:55,158 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2025-03-08 05:28:55,167 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:28:55,169 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product30.cil.c that has 27 procedures, 574 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:28:55,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:28:55,226 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;@862e25a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:28:55,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:28:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 574 states, 450 states have (on average 1.6933333333333334) internal successors, (762), 473 states have internal predecessors, (762), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 05:28:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 05:28:55,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:55,242 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] [2025-03-08 05:28:55,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:55,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:55,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1178100923, now seen corresponding path program 1 times [2025-03-08 05:28:55,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:55,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363776723] [2025-03-08 05:28:55,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:55,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 05:28:55,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:28:55,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:55,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:55,698 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:55,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:55,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363776723] [2025-03-08 05:28:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363776723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:55,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:55,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064021590] [2025-03-08 05:28:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:55,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:55,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:55,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:55,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:55,721 INFO L87 Difference]: Start difference. First operand has 574 states, 450 states have (on average 1.6933333333333334) internal successors, (762), 473 states have internal predecessors, (762), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:55,849 INFO L93 Difference]: Finished difference Result 1128 states and 1883 transitions. [2025-03-08 05:28:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:55,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2025-03-08 05:28:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:55,864 INFO L225 Difference]: With dead ends: 1128 [2025-03-08 05:28:55,864 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 05:28:55,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:55,872 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 5 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2798 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:55,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2798 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:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 05:28:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-08 05:28:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 444 states have (on average 1.6914414414414414) internal successors, (751), 465 states have internal predecessors, (751), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 938 transitions. [2025-03-08 05:28:55,931 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 938 transitions. Word has length 62 [2025-03-08 05:28:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:55,931 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 938 transitions. [2025-03-08 05:28:55,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 938 transitions. [2025-03-08 05:28:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:28:55,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:55,938 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] [2025-03-08 05:28:55,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:28:55,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:55,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash 989430138, now seen corresponding path program 1 times [2025-03-08 05:28:55,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:55,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178979613] [2025-03-08 05:28:55,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:55,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:55,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:28:55,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:28:55,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:55,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:56,140 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:56,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:56,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178979613] [2025-03-08 05:28:56,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178979613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:56,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:56,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828520353] [2025-03-08 05:28:56,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:56,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:56,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:56,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:56,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:56,142 INFO L87 Difference]: Start difference. First operand 566 states and 938 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:56,200 INFO L93 Difference]: Finished difference Result 1114 states and 1853 transitions. [2025-03-08 05:28:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:56,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2025-03-08 05:28:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:56,207 INFO L225 Difference]: With dead ends: 1114 [2025-03-08 05:28:56,207 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 05:28:56,209 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:56,210 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 4 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2777 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:56,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2777 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:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 05:28:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-08 05:28:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 444 states have (on average 1.6891891891891893) internal successors, (750), 465 states have internal predecessors, (750), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 937 transitions. [2025-03-08 05:28:56,241 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 937 transitions. Word has length 64 [2025-03-08 05:28:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:56,241 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 937 transitions. [2025-03-08 05:28:56,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 937 transitions. [2025-03-08 05:28:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:28:56,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:56,243 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] [2025-03-08 05:28:56,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:28:56,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:56,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash -11454552, now seen corresponding path program 1 times [2025-03-08 05:28:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:56,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433966151] [2025-03-08 05:28:56,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:56,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:28:56,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:28:56,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:56,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:56,390 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:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433966151] [2025-03-08 05:28:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433966151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:56,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:56,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:56,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806741160] [2025-03-08 05:28:56,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:56,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:56,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:56,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:56,392 INFO L87 Difference]: Start difference. First operand 566 states and 937 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:56,443 INFO L93 Difference]: Finished difference Result 1114 states and 1852 transitions. [2025-03-08 05:28:56,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:56,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2025-03-08 05:28:56,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:56,450 INFO L225 Difference]: With dead ends: 1114 [2025-03-08 05:28:56,450 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 05:28:56,454 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:56,455 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 3 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2777 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:56,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2777 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:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 05:28:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-08 05:28:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 444 states have (on average 1.686936936936937) internal successors, (749), 465 states have internal predecessors, (749), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 936 transitions. [2025-03-08 05:28:56,482 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 936 transitions. Word has length 65 [2025-03-08 05:28:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:56,482 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 936 transitions. [2025-03-08 05:28:56,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 936 transitions. [2025-03-08 05:28:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:28:56,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:56,484 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] [2025-03-08 05:28:56,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:28:56,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:56,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1379258307, now seen corresponding path program 1 times [2025-03-08 05:28:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148459130] [2025-03-08 05:28:56,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:56,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:28:56,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:28:56,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:56,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:56,633 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:56,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148459130] [2025-03-08 05:28:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148459130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:56,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210476857] [2025-03-08 05:28:56,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:56,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:56,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:56,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:56,636 INFO L87 Difference]: Start difference. First operand 566 states and 936 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:56,681 INFO L93 Difference]: Finished difference Result 1114 states and 1851 transitions. [2025-03-08 05:28:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:56,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2025-03-08 05:28:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:56,687 INFO L225 Difference]: With dead ends: 1114 [2025-03-08 05:28:56,687 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 05:28:56,689 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:56,691 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 2 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2777 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:56,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2777 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:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 05:28:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-08 05:28:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 444 states have (on average 1.6846846846846846) internal successors, (748), 465 states have internal predecessors, (748), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 935 transitions. [2025-03-08 05:28:56,722 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 935 transitions. Word has length 66 [2025-03-08 05:28:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:56,722 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 935 transitions. [2025-03-08 05:28:56,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 935 transitions. [2025-03-08 05:28:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:28:56,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:56,726 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] [2025-03-08 05:28:56,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:28:56,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:56,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:56,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1236651189, now seen corresponding path program 1 times [2025-03-08 05:28:56,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:56,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220701180] [2025-03-08 05:28:56,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:56,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:56,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:28:56,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:28:56,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:56,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:56,849 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:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:56,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220701180] [2025-03-08 05:28:56,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220701180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:56,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:56,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:56,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260864932] [2025-03-08 05:28:56,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:56,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:56,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:56,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:56,851 INFO L87 Difference]: Start difference. First operand 566 states and 935 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:56,892 INFO L93 Difference]: Finished difference Result 1114 states and 1850 transitions. [2025-03-08 05:28:56,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:56,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2025-03-08 05:28:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:56,898 INFO L225 Difference]: With dead ends: 1114 [2025-03-08 05:28:56,898 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 05:28:56,900 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:56,902 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 1 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2777 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:56,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2777 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:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 05:28:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-08 05:28:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 444 states have (on average 1.6824324324324325) internal successors, (747), 465 states have internal predecessors, (747), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 934 transitions. [2025-03-08 05:28:56,929 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 934 transitions. Word has length 67 [2025-03-08 05:28:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:56,930 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 934 transitions. [2025-03-08 05:28:56,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 934 transitions. [2025-03-08 05:28:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:28:56,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:56,934 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] [2025-03-08 05:28:56,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:28:56,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:56,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:56,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1515947264, now seen corresponding path program 1 times [2025-03-08 05:28:56,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:56,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944545427] [2025-03-08 05:28:56,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:56,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:56,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:28:56,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:28:56,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:56,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:57,175 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:57,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:57,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944545427] [2025-03-08 05:28:57,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944545427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:57,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:57,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:28:57,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278884455] [2025-03-08 05:28:57,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:57,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:28:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:57,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:28:57,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:57,176 INFO L87 Difference]: Start difference. First operand 566 states and 934 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:28:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:57,285 INFO L93 Difference]: Finished difference Result 1080 states and 1782 transitions. [2025-03-08 05:28:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:28:57,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-03-08 05:28:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:57,292 INFO L225 Difference]: With dead ends: 1080 [2025-03-08 05:28:57,292 INFO L226 Difference]: Without dead ends: 581 [2025-03-08 05:28:57,295 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:57,295 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 91 mSDsluCounter, 6371 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7293 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:57,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7293 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:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-08 05:28:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2025-03-08 05:28:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 454 states have (on average 1.6784140969162995) internal successors, (762), 477 states have internal predecessors, (762), 97 states have call successors, (97), 26 states have call predecessors, (97), 27 states have return successors, (94), 89 states have call predecessors, (94), 92 states have call successors, (94) [2025-03-08 05:28:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 953 transitions. [2025-03-08 05:28:57,318 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 953 transitions. Word has length 68 [2025-03-08 05:28:57,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:57,319 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 953 transitions. [2025-03-08 05:28:57,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:28:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 953 transitions. [2025-03-08 05:28:57,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:28:57,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:57,321 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] [2025-03-08 05:28:57,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:28:57,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:57,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:57,321 INFO L85 PathProgramCache]: Analyzing trace with hash -382756671, now seen corresponding path program 1 times [2025-03-08 05:28:57,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:57,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730138351] [2025-03-08 05:28:57,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:57,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:28:57,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:28:57,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:57,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:57,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730138351] [2025-03-08 05:28:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730138351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:57,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:57,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:57,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31521472] [2025-03-08 05:28:57,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:57,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:57,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:57,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:57,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:57,390 INFO L87 Difference]: Start difference. First operand 579 states and 953 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:57,421 INFO L93 Difference]: Finished difference Result 1132 states and 1876 transitions. [2025-03-08 05:28:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:57,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-03-08 05:28:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:57,426 INFO L225 Difference]: With dead ends: 1132 [2025-03-08 05:28:57,426 INFO L226 Difference]: Without dead ends: 560 [2025-03-08 05:28:57,428 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:57,429 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 0 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2779 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:57,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2779 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:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-08 05:28:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-08 05:28:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 438 states have (on average 1.67351598173516) internal successors, (733), 459 states have internal predecessors, (733), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 920 transitions. [2025-03-08 05:28:57,446 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 920 transitions. Word has length 68 [2025-03-08 05:28:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:57,447 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 920 transitions. [2025-03-08 05:28:57,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 920 transitions. [2025-03-08 05:28:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:28:57,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:57,448 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] [2025-03-08 05:28:57,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:28:57,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:57,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1768820089, now seen corresponding path program 1 times [2025-03-08 05:28:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096417280] [2025-03-08 05:28:57,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:57,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:28:57,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:28:57,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:57,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:57,550 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:57,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:57,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096417280] [2025-03-08 05:28:57,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096417280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:57,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:57,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:57,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114032056] [2025-03-08 05:28:57,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:57,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:57,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:57,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:57,552 INFO L87 Difference]: Start difference. First operand 560 states and 920 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:57,720 INFO L93 Difference]: Finished difference Result 1077 states and 1774 transitions. [2025-03-08 05:28:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:57,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2025-03-08 05:28:57,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:57,726 INFO L225 Difference]: With dead ends: 1077 [2025-03-08 05:28:57,727 INFO L226 Difference]: Without dead ends: 569 [2025-03-08 05:28:57,729 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:57,729 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 55 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4356 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:57,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4356 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:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-08 05:28:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 560. [2025-03-08 05:28:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 438 states have (on average 1.6643835616438356) internal successors, (729), 459 states have internal predecessors, (729), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 916 transitions. [2025-03-08 05:28:57,749 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 916 transitions. Word has length 69 [2025-03-08 05:28:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:57,749 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 916 transitions. [2025-03-08 05:28:57,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 916 transitions. [2025-03-08 05:28:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:28:57,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:57,751 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] [2025-03-08 05:28:57,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:28:57,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:57,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash -272507863, now seen corresponding path program 1 times [2025-03-08 05:28:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902446780] [2025-03-08 05:28:57,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:57,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:28:57,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:28:57,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:57,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:57,867 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:57,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:57,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902446780] [2025-03-08 05:28:57,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902446780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:57,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:57,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757435622] [2025-03-08 05:28:57,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:57,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:57,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:57,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:57,870 INFO L87 Difference]: Start difference. First operand 560 states and 916 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:58,007 INFO L93 Difference]: Finished difference Result 1077 states and 1770 transitions. [2025-03-08 05:28:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:58,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2025-03-08 05:28:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:58,013 INFO L225 Difference]: With dead ends: 1077 [2025-03-08 05:28:58,013 INFO L226 Difference]: Without dead ends: 569 [2025-03-08 05:28:58,015 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:58,015 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 54 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4356 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:58,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4356 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:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-08 05:28:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 560. [2025-03-08 05:28:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 438 states have (on average 1.6552511415525115) internal successors, (725), 459 states have internal predecessors, (725), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 912 transitions. [2025-03-08 05:28:58,035 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 912 transitions. Word has length 70 [2025-03-08 05:28:58,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:58,035 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 912 transitions. [2025-03-08 05:28:58,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 912 transitions. [2025-03-08 05:28:58,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:28:58,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:58,036 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] [2025-03-08 05:28:58,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:28:58,037 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:58,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1047345194, now seen corresponding path program 1 times [2025-03-08 05:28:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131191908] [2025-03-08 05:28:58,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:58,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:28:58,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:28:58,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:58,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:58,159 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:58,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131191908] [2025-03-08 05:28:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131191908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:58,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:58,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84729014] [2025-03-08 05:28:58,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:58,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:58,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:58,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:58,162 INFO L87 Difference]: Start difference. First operand 560 states and 912 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:58,291 INFO L93 Difference]: Finished difference Result 1077 states and 1766 transitions. [2025-03-08 05:28:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:58,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-03-08 05:28:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:58,296 INFO L225 Difference]: With dead ends: 1077 [2025-03-08 05:28:58,297 INFO L226 Difference]: Without dead ends: 569 [2025-03-08 05:28:58,299 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:58,299 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 53 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4338 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:58,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4338 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:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-08 05:28:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 560. [2025-03-08 05:28:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 438 states have (on average 1.6461187214611872) internal successors, (721), 459 states have internal predecessors, (721), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 908 transitions. [2025-03-08 05:28:58,317 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 908 transitions. Word has length 71 [2025-03-08 05:28:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:58,317 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 908 transitions. [2025-03-08 05:28:58,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 908 transitions. [2025-03-08 05:28:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:28:58,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:58,318 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] [2025-03-08 05:28:58,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:28:58,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:58,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:58,319 INFO L85 PathProgramCache]: Analyzing trace with hash 835758407, now seen corresponding path program 1 times [2025-03-08 05:28:58,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460252649] [2025-03-08 05:28:58,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:58,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:28:58,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:28:58,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:58,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:58,446 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:58,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:58,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460252649] [2025-03-08 05:28:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460252649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:58,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395844525] [2025-03-08 05:28:58,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:58,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:58,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:58,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:58,448 INFO L87 Difference]: Start difference. First operand 560 states and 908 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:28:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:58,500 INFO L93 Difference]: Finished difference Result 1068 states and 1748 transitions. [2025-03-08 05:28:58,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:28:58,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2025-03-08 05:28:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:58,506 INFO L225 Difference]: With dead ends: 1068 [2025-03-08 05:28:58,506 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 05:28:58,508 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:58,509 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 84 mSDsluCounter, 4412 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5309 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:58,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5309 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:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 05:28:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-03-08 05:28:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 417 states have (on average 1.6474820143884892) internal successors, (687), 438 states have internal predecessors, (687), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 874 transitions. [2025-03-08 05:28:58,525 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 874 transitions. Word has length 71 [2025-03-08 05:28:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:58,525 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 874 transitions. [2025-03-08 05:28:58,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:28:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 874 transitions. [2025-03-08 05:28:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:28:58,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:58,527 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] [2025-03-08 05:28:58,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:28:58,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:58,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:58,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1215678938, now seen corresponding path program 1 times [2025-03-08 05:28:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:58,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852068358] [2025-03-08 05:28:58,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:58,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:28:58,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:28:58,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:58,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:58,628 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:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:58,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852068358] [2025-03-08 05:28:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852068358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:58,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:58,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365391811] [2025-03-08 05:28:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:58,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:58,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:58,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:58,630 INFO L87 Difference]: Start difference. First operand 539 states and 874 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:58,690 INFO L93 Difference]: Finished difference Result 1047 states and 1714 transitions. [2025-03-08 05:28:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:58,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-03-08 05:28:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:58,695 INFO L225 Difference]: With dead ends: 1047 [2025-03-08 05:28:58,695 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 05:28:58,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:58,697 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 17 mSDsluCounter, 3419 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4276 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:58,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4276 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:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 05:28:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-03-08 05:28:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 417 states have (on average 1.645083932853717) internal successors, (686), 438 states have internal predecessors, (686), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 873 transitions. [2025-03-08 05:28:58,713 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 873 transitions. Word has length 72 [2025-03-08 05:28:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:58,713 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 873 transitions. [2025-03-08 05:28:58,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 873 transitions. [2025-03-08 05:28:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 05:28:58,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:58,715 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] [2025-03-08 05:28:58,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:28:58,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:58,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:58,715 INFO L85 PathProgramCache]: Analyzing trace with hash 237729331, now seen corresponding path program 1 times [2025-03-08 05:28:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:58,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890750903] [2025-03-08 05:28:58,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:58,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 05:28:58,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 05:28:58,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:58,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:58,805 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:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890750903] [2025-03-08 05:28:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890750903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892330953] [2025-03-08 05:28:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:58,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:58,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:58,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:58,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:58,807 INFO L87 Difference]: Start difference. First operand 539 states and 873 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:58,881 INFO L93 Difference]: Finished difference Result 1047 states and 1713 transitions. [2025-03-08 05:28:58,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:58,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-08 05:28:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:58,885 INFO L225 Difference]: With dead ends: 1047 [2025-03-08 05:28:58,885 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 05:28:58,887 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:58,888 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 16 mSDsluCounter, 3419 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4276 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:58,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4276 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:58,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 05:28:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-03-08 05:28:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 417 states have (on average 1.6426858513189448) internal successors, (685), 438 states have internal predecessors, (685), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 872 transitions. [2025-03-08 05:28:58,903 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 872 transitions. Word has length 73 [2025-03-08 05:28:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:58,903 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 872 transitions. [2025-03-08 05:28:58,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:28:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 872 transitions. [2025-03-08 05:28:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:28:58,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:58,904 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] [2025-03-08 05:28:58,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:28:58,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:58,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash 425532451, now seen corresponding path program 1 times [2025-03-08 05:28:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:58,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13708994] [2025-03-08 05:28:58,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:58,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:28:58,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:28:58,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:58,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:59,089 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:59,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13708994] [2025-03-08 05:28:59,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13708994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:59,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:59,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:28:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758076177] [2025-03-08 05:28:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:59,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:28:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:59,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:28:59,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:59,091 INFO L87 Difference]: Start difference. First operand 539 states and 872 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:28:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:59,170 INFO L93 Difference]: Finished difference Result 1041 states and 1701 transitions. [2025-03-08 05:28:59,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:28:59,170 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2025-03-08 05:28:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:59,173 INFO L225 Difference]: With dead ends: 1041 [2025-03-08 05:28:59,173 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 05:28:59,176 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:59,178 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 6 mSDsluCounter, 6826 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7682 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:59,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7682 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:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 05:28:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-03-08 05:28:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 417 states have (on average 1.6402877697841727) internal successors, (684), 438 states have internal predecessors, (684), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 871 transitions. [2025-03-08 05:28:59,194 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 871 transitions. Word has length 74 [2025-03-08 05:28:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:59,194 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 871 transitions. [2025-03-08 05:28:59,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:28:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 871 transitions. [2025-03-08 05:28:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 05:28:59,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:59,197 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] [2025-03-08 05:28:59,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:28:59,197 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:59,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash 302140000, now seen corresponding path program 1 times [2025-03-08 05:28:59,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:59,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40809001] [2025-03-08 05:28:59,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:59,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:28:59,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:28:59,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:59,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:59,385 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:59,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40809001] [2025-03-08 05:28:59,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40809001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:59,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:59,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:59,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109685686] [2025-03-08 05:28:59,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:59,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:59,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:59,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:59,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:59,386 INFO L87 Difference]: Start difference. First operand 539 states and 871 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-08 05:29:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:01,231 INFO L93 Difference]: Finished difference Result 1662 states and 2748 transitions. [2025-03-08 05:29:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:01,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 75 [2025-03-08 05:29:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:01,241 INFO L225 Difference]: With dead ends: 1662 [2025-03-08 05:29:01,241 INFO L226 Difference]: Without dead ends: 1168 [2025-03-08 05:29:01,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:01,245 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 2603 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:01,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2667 Valid, 1111 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 05:29:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-03-08 05:29:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1036. [2025-03-08 05:29:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 809 states have (on average 1.661310259579728) internal successors, (1344), 839 states have internal predecessors, (1344), 179 states have call successors, (179), 46 states have call predecessors, (179), 47 states have return successors, (181), 163 states have call predecessors, (181), 174 states have call successors, (181) [2025-03-08 05:29:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1704 transitions. [2025-03-08 05:29:01,295 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1704 transitions. Word has length 75 [2025-03-08 05:29:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:01,295 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1704 transitions. [2025-03-08 05:29:01,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-08 05:29:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1704 transitions. [2025-03-08 05:29:01,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:29:01,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:01,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:01,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:29:01,298 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:01,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:01,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1773325443, now seen corresponding path program 1 times [2025-03-08 05:29:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734950087] [2025-03-08 05:29:01,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:01,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:01,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:29:01,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:29:01,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:01,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:01,599 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:29:01,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:01,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734950087] [2025-03-08 05:29:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734950087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:01,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:01,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:29:01,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275145889] [2025-03-08 05:29:01,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:01,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:29:01,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:01,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:29:01,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:01,602 INFO L87 Difference]: Start difference. First operand 1036 states and 1704 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 05:29:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:03,045 INFO L93 Difference]: Finished difference Result 2035 states and 3410 transitions. [2025-03-08 05:29:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:03,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 114 [2025-03-08 05:29:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:03,052 INFO L225 Difference]: With dead ends: 2035 [2025-03-08 05:29:03,052 INFO L226 Difference]: Without dead ends: 1044 [2025-03-08 05:29:03,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 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:29:03,058 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1329 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 2820 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 3212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 2820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:03,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 1553 Invalid, 3212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 2820 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 05:29:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-03-08 05:29:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2025-03-08 05:29:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 815 states have (on average 1.656441717791411) internal successors, (1350), 845 states have internal predecessors, (1350), 179 states have call successors, (179), 46 states have call predecessors, (179), 49 states have return successors, (213), 165 states have call predecessors, (213), 174 states have call successors, (213) [2025-03-08 05:29:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1742 transitions. [2025-03-08 05:29:03,118 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1742 transitions. Word has length 114 [2025-03-08 05:29:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:03,118 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1742 transitions. [2025-03-08 05:29:03,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 05:29:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1742 transitions. [2025-03-08 05:29:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:29:03,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:03,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:03,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:29:03,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:03,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash -722395251, now seen corresponding path program 1 times [2025-03-08 05:29:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:03,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046525866] [2025-03-08 05:29:03,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:03,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:29:03,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:29:03,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:03,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:03,364 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:29:03,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:03,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046525866] [2025-03-08 05:29:03,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046525866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:03,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 05:29:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835556504] [2025-03-08 05:29:03,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:03,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:29:03,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:03,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:29:03,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:29:03,366 INFO L87 Difference]: Start difference. First operand 1044 states and 1742 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 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:29:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:07,787 INFO L93 Difference]: Finished difference Result 3782 states and 6354 transitions. [2025-03-08 05:29:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:29:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 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 114 [2025-03-08 05:29:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:07,804 INFO L225 Difference]: With dead ends: 3782 [2025-03-08 05:29:07,805 INFO L226 Difference]: Without dead ends: 2783 [2025-03-08 05:29:07,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:29:07,811 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 2793 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 9770 mSolverCounterSat, 871 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2868 SdHoareTripleChecker+Valid, 4200 SdHoareTripleChecker+Invalid, 10641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 871 IncrementalHoareTripleChecker+Valid, 9770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:07,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2868 Valid, 4200 Invalid, 10641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [871 Valid, 9770 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 05:29:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2025-03-08 05:29:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2687. [2025-03-08 05:29:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2038 states have (on average 1.6295387634936211) internal successors, (3321), 2114 states have internal predecessors, (3321), 516 states have call successors, (516), 109 states have call predecessors, (516), 132 states have return successors, (615), 496 states have call predecessors, (615), 511 states have call successors, (615) [2025-03-08 05:29:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4452 transitions. [2025-03-08 05:29:07,955 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4452 transitions. Word has length 114 [2025-03-08 05:29:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:07,956 INFO L471 AbstractCegarLoop]: Abstraction has 2687 states and 4452 transitions. [2025-03-08 05:29:07,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 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:29:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4452 transitions. [2025-03-08 05:29:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:29:07,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:07,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:07,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:29:07,959 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:07,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1575932201, now seen corresponding path program 1 times [2025-03-08 05:29:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008110427] [2025-03-08 05:29:07,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:07,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:07,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:29:07,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:29:07,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:07,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:08,134 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:29:08,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:08,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008110427] [2025-03-08 05:29:08,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008110427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:08,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:08,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:29:08,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471219868] [2025-03-08 05:29:08,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:08,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:29:08,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:08,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:29:08,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:08,135 INFO L87 Difference]: Start difference. First operand 2687 states and 4452 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:29:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:10,509 INFO L93 Difference]: Finished difference Result 8607 states and 14649 transitions. [2025-03-08 05:29:10,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:29:10,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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 115 [2025-03-08 05:29:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:10,535 INFO L225 Difference]: With dead ends: 8607 [2025-03-08 05:29:10,535 INFO L226 Difference]: Without dead ends: 5965 [2025-03-08 05:29:10,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 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:29:10,548 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 2783 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 4643 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2857 SdHoareTripleChecker+Valid, 2296 SdHoareTripleChecker+Invalid, 5371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 4643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:10,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2857 Valid, 2296 Invalid, 5371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 4643 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 05:29:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2025-03-08 05:29:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 5666. [2025-03-08 05:29:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5666 states, 4270 states have (on average 1.6098360655737705) internal successors, (6874), 4451 states have internal predecessors, (6874), 1111 states have call successors, (1111), 252 states have call predecessors, (1111), 284 states have return successors, (1296), 1039 states have call predecessors, (1296), 1106 states have call successors, (1296) [2025-03-08 05:29:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5666 states to 5666 states and 9281 transitions. [2025-03-08 05:29:10,840 INFO L78 Accepts]: Start accepts. Automaton has 5666 states and 9281 transitions. Word has length 115 [2025-03-08 05:29:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:10,842 INFO L471 AbstractCegarLoop]: Abstraction has 5666 states and 9281 transitions. [2025-03-08 05:29:10,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:29:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5666 states and 9281 transitions. [2025-03-08 05:29:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:29:10,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:10,849 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:10,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:29:10,849 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:10,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:10,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1172860508, now seen corresponding path program 1 times [2025-03-08 05:29:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017400122] [2025-03-08 05:29:10,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:10,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:29:10,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:29:10,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:10,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:29:10,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:10,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017400122] [2025-03-08 05:29:10,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017400122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:10,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:10,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517723294] [2025-03-08 05:29:10,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:10,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:10,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:10,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:11,000 INFO L87 Difference]: Start difference. First operand 5666 states and 9281 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:29:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:13,460 INFO L93 Difference]: Finished difference Result 16338 states and 27338 transitions. [2025-03-08 05:29:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:13,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 117 [2025-03-08 05:29:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:13,527 INFO L225 Difference]: With dead ends: 16338 [2025-03-08 05:29:13,527 INFO L226 Difference]: Without dead ends: 10713 [2025-03-08 05:29:13,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:13,557 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 3405 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 3493 mSolverCounterSat, 1037 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3438 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 4530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1037 IncrementalHoareTripleChecker+Valid, 3493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:13,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3438 Valid, 2023 Invalid, 4530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1037 Valid, 3493 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 05:29:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10713 states. [2025-03-08 05:29:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10713 to 9501. [2025-03-08 05:29:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9501 states, 6861 states have (on average 1.589855706165282) internal successors, (10908), 7272 states have internal predecessors, (10908), 2183 states have call successors, (2183), 384 states have call predecessors, (2183), 456 states have return successors, (2605), 2117 states have call predecessors, (2605), 2178 states have call successors, (2605) [2025-03-08 05:29:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9501 states to 9501 states and 15696 transitions. [2025-03-08 05:29:14,078 INFO L78 Accepts]: Start accepts. Automaton has 9501 states and 15696 transitions. Word has length 117 [2025-03-08 05:29:14,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:14,079 INFO L471 AbstractCegarLoop]: Abstraction has 9501 states and 15696 transitions. [2025-03-08 05:29:14,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:29:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 9501 states and 15696 transitions. [2025-03-08 05:29:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:29:14,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:14,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:14,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:29:14,083 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:14,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash -362840577, now seen corresponding path program 1 times [2025-03-08 05:29:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:14,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089493776] [2025-03-08 05:29:14,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:14,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:29:14,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:29:14,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:14,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:29:14,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:14,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089493776] [2025-03-08 05:29:14,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089493776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:14,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:14,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:14,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960368546] [2025-03-08 05:29:14,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:14,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:14,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:14,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:14,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:14,221 INFO L87 Difference]: Start difference. First operand 9501 states and 15696 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:29:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:17,326 INFO L93 Difference]: Finished difference Result 31748 states and 54135 transitions. [2025-03-08 05:29:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:17,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 118 [2025-03-08 05:29:17,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:17,443 INFO L225 Difference]: With dead ends: 31748 [2025-03-08 05:29:17,443 INFO L226 Difference]: Without dead ends: 22295 [2025-03-08 05:29:17,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:17,481 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 3418 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 3462 mSolverCounterSat, 1057 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3452 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 4519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1057 IncrementalHoareTripleChecker+Valid, 3462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:17,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3452 Valid, 2036 Invalid, 4519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1057 Valid, 3462 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 05:29:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22295 states. [2025-03-08 05:29:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22295 to 19952. [2025-03-08 05:29:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19952 states, 13525 states have (on average 1.5656931608133087) internal successors, (21176), 14601 states have internal predecessors, (21176), 5556 states have call successors, (5556), 650 states have call predecessors, (5556), 870 states have return successors, (6904), 5568 states have call predecessors, (6904), 5551 states have call successors, (6904) [2025-03-08 05:29:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19952 states to 19952 states and 33636 transitions. [2025-03-08 05:29:18,814 INFO L78 Accepts]: Start accepts. Automaton has 19952 states and 33636 transitions. Word has length 118 [2025-03-08 05:29:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:18,815 INFO L471 AbstractCegarLoop]: Abstraction has 19952 states and 33636 transitions. [2025-03-08 05:29:18,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:29:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19952 states and 33636 transitions. [2025-03-08 05:29:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:29:18,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:18,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:18,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:29:18,819 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:18,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:18,820 INFO L85 PathProgramCache]: Analyzing trace with hash 940413631, now seen corresponding path program 1 times [2025-03-08 05:29:18,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:18,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686668204] [2025-03-08 05:29:18,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:18,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:18,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:29:18,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:29:18,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:18,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:29:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686668204] [2025-03-08 05:29:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686668204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400695197] [2025-03-08 05:29:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:18,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:18,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:18,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:18,999 INFO L87 Difference]: Start difference. First operand 19952 states and 33636 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:29:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:24,460 INFO L93 Difference]: Finished difference Result 76926 states and 134599 transitions. [2025-03-08 05:29:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:24,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 119 [2025-03-08 05:29:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:24,928 INFO L225 Difference]: With dead ends: 76926 [2025-03-08 05:29:24,928 INFO L226 Difference]: Without dead ends: 57024 [2025-03-08 05:29:25,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:25,080 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 3430 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 3467 mSolverCounterSat, 1061 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3465 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1061 IncrementalHoareTripleChecker+Valid, 3467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:25,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3465 Valid, 2057 Invalid, 4528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1061 Valid, 3467 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 05:29:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57024 states. [2025-03-08 05:29:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57024 to 51123. [2025-03-08 05:29:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51123 states, 32403 states have (on average 1.5443323149091133) internal successors, (50041), 35536 states have internal predecessors, (50041), 16751 states have call successors, (16751), 1182 states have call predecessors, (16751), 1968 states have return successors, (22005), 17183 states have call predecessors, (22005), 16746 states have call successors, (22005) [2025-03-08 05:29:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51123 states to 51123 states and 88797 transitions. [2025-03-08 05:29:29,011 INFO L78 Accepts]: Start accepts. Automaton has 51123 states and 88797 transitions. Word has length 119 [2025-03-08 05:29:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:29,012 INFO L471 AbstractCegarLoop]: Abstraction has 51123 states and 88797 transitions. [2025-03-08 05:29:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:29:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 51123 states and 88797 transitions. [2025-03-08 05:29:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:29:29,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:29,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:29,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:29:29,015 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:29,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash 354061242, now seen corresponding path program 1 times [2025-03-08 05:29:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:29,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983063565] [2025-03-08 05:29:29,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:29,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:29,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:29:29,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:29:29,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:29,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:29:29,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:29,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983063565] [2025-03-08 05:29:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983063565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379246924] [2025-03-08 05:29:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:29,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:29,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:29,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:29,147 INFO L87 Difference]: Start difference. First operand 51123 states and 88797 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:29:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:43,550 INFO L93 Difference]: Finished difference Result 219690 states and 395532 transitions. [2025-03-08 05:29:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 120 [2025-03-08 05:29:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:44,810 INFO L225 Difference]: With dead ends: 219690 [2025-03-08 05:29:44,810 INFO L226 Difference]: Without dead ends: 168621 [2025-03-08 05:29:45,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:45,132 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 3442 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 1063 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3478 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 4539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1063 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:45,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3478 Valid, 2078 Invalid, 4539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1063 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 05:29:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168621 states.