./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8090ac1e7e8284dad30217492085f9e11f6491349a4adb4aa3c2904a72e0131a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:15:57,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:15:57,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:15:57,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:15:57,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:15:57,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:15:57,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:15:57,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:15:57,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:15:57,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:15:57,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:15:57,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:15:57,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:15:57,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:15:57,343 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:15:57,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:15:57,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:15:57,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:15:57,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:15:57,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:15:57,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:15:57,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:15:57,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:15:57,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:15:57,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:15:57,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:15:57,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:15:57,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:15:57,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:15:57,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:15:57,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:15:57,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:15:57,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:57,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:15:57,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:15:57,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:15:57,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:15:57,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:15:57,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:15:57,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:15:57,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:15:57,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:15:57,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:15:57,346 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 -> 8090ac1e7e8284dad30217492085f9e11f6491349a4adb4aa3c2904a72e0131a [2025-03-03 14:15:57,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:15:57,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:15:57,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:15:57,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:15:57,598 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:15:57,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c [2025-03-03 14:15:58,813 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91f072b42/8a29b8f0412a406da0913d51937ecc6f/FLAG00901e5e4 [2025-03-03 14:15:59,176 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:15:59,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c [2025-03-03 14:15:59,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91f072b42/8a29b8f0412a406da0913d51937ecc6f/FLAG00901e5e4 [2025-03-03 14:15:59,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91f072b42/8a29b8f0412a406da0913d51937ecc6f [2025-03-03 14:15:59,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:15:59,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:15:59,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:59,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:15:59,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:15:59,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:15:59,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caa8ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59, skipping insertion in model container [2025-03-03 14:15:59,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:15:59,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:15:59,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c[1545,1558] [2025-03-03 14:15:59,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:59,859 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:15:59,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-03 14:15:59,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [57] [2025-03-03 14:15:59,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [421] [2025-03-03 14:15:59,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1088] [2025-03-03 14:15:59,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1454] [2025-03-03 14:15:59,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1466] [2025-03-03 14:15:59,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1586] [2025-03-03 14:15:59,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1621] [2025-03-03 14:15:59,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3188] [2025-03-03 14:15:59,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3279] [2025-03-03 14:15:59,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c[1545,1558] [2025-03-03 14:15:59,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:59,965 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:15:59,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59 WrapperNode [2025-03-03 14:15:59,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:59,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:59,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:15:59,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:15:59,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:15:59,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,024 INFO L138 Inliner]: procedures = 94, calls = 345, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 872 [2025-03-03 14:16:00,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:16:00,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:16:00,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:16:00,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:16:00,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,066 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:16:00,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:16:00,088 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:16:00,088 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:16:00,088 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:16:00,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (1/1) ... [2025-03-03 14:16:00,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:16:00,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:00,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:16:00,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:16:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:16:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:16:00,138 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:16:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:16:00,138 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:16:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:16:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:16:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:16:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:16:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:16:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:16:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:16:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:16:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:16:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:16:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:16:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:16:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:16:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:16:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:16:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:16:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:16:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:16:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:16:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:16:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:16:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:16:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:16:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:16:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:16:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:16:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:16:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:16:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:16:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:16:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-03-03 14:16:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:16:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:16:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:16:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:16:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:16:00,279 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:16:00,281 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:16:00,322 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583: #res := ~retValue_acc~10; [2025-03-03 14:16:00,340 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505: #res := ~retValue_acc~8; [2025-03-03 14:16:00,344 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1699: #res := ~retValue_acc~13; [2025-03-03 14:16:00,357 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1857: #res := ~retValue_acc~14; [2025-03-03 14:16:00,547 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2433: #res#1 := ~retValue_acc~22#1; [2025-03-03 14:16:00,547 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2467-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~23#1; [2025-03-03 14:16:00,619 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: #res := ~retValue_acc~26; [2025-03-03 14:16:00,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1544: #res := ~retValue_acc~9; [2025-03-03 14:16:00,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900: #res := ~retValue_acc~16; [2025-03-03 14:16:00,779 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2042-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-03 14:16:00,779 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2029-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-03 14:16:00,878 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L774: #res := ~retValue_acc~3; [2025-03-03 14:16:00,990 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2523-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~24#1; [2025-03-03 14:16:00,990 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2551-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~25#1; [2025-03-03 14:16:01,095 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2394: #res := ~retValue_acc~21; [2025-03-03 14:16:01,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L418-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-03 14:16:01,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-03 14:16:01,158 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: #res := ~retValue_acc~2; [2025-03-03 14:16:01,161 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866: #res := ~retValue_acc~15; [2025-03-03 14:16:01,164 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1085: #res := ~retValue_acc~4; [2025-03-03 14:16:01,276 INFO L? ?]: Removed 450 outVars from TransFormulas that were not future-live. [2025-03-03 14:16:01,276 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:16:01,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:16:01,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:16:01,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:16:01 BoogieIcfgContainer [2025-03-03 14:16:01,296 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:16:01,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:16:01,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:16:01,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:16:01,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:15:59" (1/3) ... [2025-03-03 14:16:01,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dbdd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:16:01, skipping insertion in model container [2025-03-03 14:16:01,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:59" (2/3) ... [2025-03-03 14:16:01,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dbdd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:16:01, skipping insertion in model container [2025-03-03 14:16:01,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:16:01" (3/3) ... [2025-03-03 14:16:01,303 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product22.cil.c [2025-03-03 14:16:01,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:16:01,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product22.cil.c that has 26 procedures, 571 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:16:01,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:16:01,392 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;@5985051c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:16:01,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:16:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 571 states, 446 states have (on average 1.6905829596412556) internal successors, (754), 469 states have internal predecessors, (754), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:16:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 14:16:01,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:01,405 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] [2025-03-03 14:16:01,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:01,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2023300020, now seen corresponding path program 1 times [2025-03-03 14:16:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003114093] [2025-03-03 14:16:01,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:01,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:16:01,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:16:01,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:01,799 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-03 14:16:01,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:01,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003114093] [2025-03-03 14:16:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003114093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:01,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:01,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091215795] [2025-03-03 14:16:01,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:01,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:01,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:01,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:01,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:01,818 INFO L87 Difference]: Start difference. First operand has 571 states, 446 states have (on average 1.6905829596412556) internal successors, (754), 469 states have internal predecessors, (754), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:01,953 INFO L93 Difference]: Finished difference Result 1122 states and 1875 transitions. [2025-03-03 14:16:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:01,955 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2025-03-03 14:16:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:01,971 INFO L225 Difference]: With dead ends: 1122 [2025-03-03 14:16:01,972 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 14:16:01,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:01,983 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 5 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:01,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2786 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 14:16:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-03-03 14:16:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 440 states have (on average 1.6886363636363637) internal successors, (743), 461 states have internal predecessors, (743), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 934 transitions. [2025-03-03 14:16:02,063 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 934 transitions. Word has length 60 [2025-03-03 14:16:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:02,064 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 934 transitions. [2025-03-03 14:16:02,064 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 934 transitions. [2025-03-03 14:16:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:16:02,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,069 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] [2025-03-03 14:16:02,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:16:02,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:02,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1965373044, now seen corresponding path program 1 times [2025-03-03 14:16:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:02,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211733739] [2025-03-03 14:16:02,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:02,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:16:02,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:16:02,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,255 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-03 14:16:02,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:02,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211733739] [2025-03-03 14:16:02,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211733739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:02,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:02,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:02,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812733792] [2025-03-03 14:16:02,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:02,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:02,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:02,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:02,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:02,258 INFO L87 Difference]: Start difference. First operand 563 states and 934 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:02,330 INFO L93 Difference]: Finished difference Result 1108 states and 1845 transitions. [2025-03-03 14:16:02,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:02,331 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-03 14:16:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:02,338 INFO L225 Difference]: With dead ends: 1108 [2025-03-03 14:16:02,339 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 14:16:02,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:02,345 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 4 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:02,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2765 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 14:16:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-03-03 14:16:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 440 states have (on average 1.6863636363636363) internal successors, (742), 461 states have internal predecessors, (742), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 933 transitions. [2025-03-03 14:16:02,386 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 933 transitions. Word has length 63 [2025-03-03 14:16:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:02,387 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 933 transitions. [2025-03-03 14:16:02,387 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 933 transitions. [2025-03-03 14:16:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:16:02,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,390 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-03 14:16:02,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:16:02,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:02,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:02,391 INFO L85 PathProgramCache]: Analyzing trace with hash -692869714, now seen corresponding path program 1 times [2025-03-03 14:16:02,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:02,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051535383] [2025-03-03 14:16:02,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:02,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:16:02,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:16:02,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,531 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-03 14:16:02,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051535383] [2025-03-03 14:16:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051535383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:02,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:02,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:02,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248542877] [2025-03-03 14:16:02,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:02,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:02,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:02,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:02,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:02,534 INFO L87 Difference]: Start difference. First operand 563 states and 933 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:02,586 INFO L93 Difference]: Finished difference Result 1108 states and 1844 transitions. [2025-03-03 14:16:02,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:02,587 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-03 14:16:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:02,590 INFO L225 Difference]: With dead ends: 1108 [2025-03-03 14:16:02,591 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 14:16:02,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:02,593 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 3 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:02,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2765 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 14:16:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-03-03 14:16:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 440 states have (on average 1.684090909090909) internal successors, (741), 461 states have internal predecessors, (741), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 932 transitions. [2025-03-03 14:16:02,612 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 932 transitions. Word has length 64 [2025-03-03 14:16:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:02,612 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 932 transitions. [2025-03-03 14:16:02,612 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 932 transitions. [2025-03-03 14:16:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:16:02,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,614 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-03 14:16:02,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:16:02,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:02,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1888073833, now seen corresponding path program 1 times [2025-03-03 14:16:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:02,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443066658] [2025-03-03 14:16:02,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:02,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:16:02,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:16:02,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,714 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-03 14:16:02,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:02,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443066658] [2025-03-03 14:16:02,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443066658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:02,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595360169] [2025-03-03 14:16:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:02,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:02,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:02,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:02,718 INFO L87 Difference]: Start difference. First operand 563 states and 932 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:02,757 INFO L93 Difference]: Finished difference Result 1108 states and 1843 transitions. [2025-03-03 14:16:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:02,758 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-03 14:16:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:02,761 INFO L225 Difference]: With dead ends: 1108 [2025-03-03 14:16:02,761 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 14:16:02,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:02,765 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 2 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:02,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2765 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 14:16:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-03-03 14:16:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 440 states have (on average 1.6818181818181819) internal successors, (740), 461 states have internal predecessors, (740), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 931 transitions. [2025-03-03 14:16:02,795 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 931 transitions. Word has length 65 [2025-03-03 14:16:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:02,796 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 931 transitions. [2025-03-03 14:16:02,796 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 931 transitions. [2025-03-03 14:16:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:16:02,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,798 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-03 14:16:02,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:16:02,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:02,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2080991147, now seen corresponding path program 1 times [2025-03-03 14:16:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:02,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023696633] [2025-03-03 14:16:02,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:02,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:16:02,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:16:02,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,932 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-03 14:16:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023696633] [2025-03-03 14:16:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023696633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:02,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:02,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885619413] [2025-03-03 14:16:02,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:02,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:02,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:02,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:02,933 INFO L87 Difference]: Start difference. First operand 563 states and 931 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:02,971 INFO L93 Difference]: Finished difference Result 1108 states and 1842 transitions. [2025-03-03 14:16:02,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:02,972 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 14:16:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:02,976 INFO L225 Difference]: With dead ends: 1108 [2025-03-03 14:16:02,976 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 14:16:02,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:02,979 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 1 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:02,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2765 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 14:16:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-03-03 14:16:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 440 states have (on average 1.6795454545454545) internal successors, (739), 461 states have internal predecessors, (739), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 930 transitions. [2025-03-03 14:16:03,007 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 930 transitions. Word has length 66 [2025-03-03 14:16:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:03,007 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 930 transitions. [2025-03-03 14:16:03,008 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 930 transitions. [2025-03-03 14:16:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:16:03,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:03,010 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-03 14:16:03,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:16:03,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:03,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1259539270, now seen corresponding path program 1 times [2025-03-03 14:16:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:03,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830007526] [2025-03-03 14:16:03,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:03,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:16:03,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:16:03,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,215 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-03 14:16:03,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:03,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830007526] [2025-03-03 14:16:03,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830007526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:03,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:03,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:16:03,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161326678] [2025-03-03 14:16:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:03,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:16:03,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:03,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:16:03,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:03,217 INFO L87 Difference]: Start difference. First operand 563 states and 930 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:03,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:03,333 INFO L93 Difference]: Finished difference Result 1074 states and 1774 transitions. [2025-03-03 14:16:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:16:03,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-03-03 14:16:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:03,338 INFO L225 Difference]: With dead ends: 1074 [2025-03-03 14:16:03,339 INFO L226 Difference]: Without dead ends: 578 [2025-03-03 14:16:03,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:03,342 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 91 mSDsluCounter, 6343 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7261 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:03,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7261 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-03 14:16:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 576. [2025-03-03 14:16:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 450 states have (on average 1.6755555555555555) internal successors, (754), 473 states have internal predecessors, (754), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2025-03-03 14:16:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 949 transitions. [2025-03-03 14:16:03,374 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 949 transitions. Word has length 67 [2025-03-03 14:16:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:03,377 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 949 transitions. [2025-03-03 14:16:03,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 949 transitions. [2025-03-03 14:16:03,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:16:03,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:03,380 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-03 14:16:03,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:16:03,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:03,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:03,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1018999141, now seen corresponding path program 1 times [2025-03-03 14:16:03,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:03,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746837511] [2025-03-03 14:16:03,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:03,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:16:03,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:16:03,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,478 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-03 14:16:03,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:03,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746837511] [2025-03-03 14:16:03,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746837511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:03,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:03,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:03,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581344054] [2025-03-03 14:16:03,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:03,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:03,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:03,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:03,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:03,481 INFO L87 Difference]: Start difference. First operand 576 states and 949 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:03,520 INFO L93 Difference]: Finished difference Result 1126 states and 1868 transitions. [2025-03-03 14:16:03,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:03,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-03 14:16:03,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:03,526 INFO L225 Difference]: With dead ends: 1126 [2025-03-03 14:16:03,526 INFO L226 Difference]: Without dead ends: 557 [2025-03-03 14:16:03,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:03,529 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 0 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:03,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2767 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-03 14:16:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-03-03 14:16:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 434 states have (on average 1.6705069124423964) internal successors, (725), 455 states have internal predecessors, (725), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 916 transitions. [2025-03-03 14:16:03,550 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 916 transitions. Word has length 67 [2025-03-03 14:16:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:03,551 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 916 transitions. [2025-03-03 14:16:03,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 916 transitions. [2025-03-03 14:16:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:16:03,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:03,554 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-03 14:16:03,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:16:03,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:03,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash -582489819, now seen corresponding path program 1 times [2025-03-03 14:16:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:03,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909963801] [2025-03-03 14:16:03,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:03,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:16:03,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:16:03,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,676 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-03 14:16:03,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:03,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909963801] [2025-03-03 14:16:03,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909963801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:03,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:03,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117400218] [2025-03-03 14:16:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:03,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:03,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:03,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:03,677 INFO L87 Difference]: Start difference. First operand 557 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:03,819 INFO L93 Difference]: Finished difference Result 1071 states and 1766 transitions. [2025-03-03 14:16:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:03,819 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-03 14:16:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:03,823 INFO L225 Difference]: With dead ends: 1071 [2025-03-03 14:16:03,823 INFO L226 Difference]: Without dead ends: 566 [2025-03-03 14:16:03,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:03,826 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 55 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4336 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:03,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4336 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-03 14:16:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-03-03 14:16:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 434 states have (on average 1.6612903225806452) internal successors, (721), 455 states have internal predecessors, (721), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 912 transitions. [2025-03-03 14:16:03,841 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 912 transitions. Word has length 68 [2025-03-03 14:16:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:03,842 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 912 transitions. [2025-03-03 14:16:03,842 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 912 transitions. [2025-03-03 14:16:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:16:03,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:03,843 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-03 14:16:03,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:16:03,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:03,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:03,844 INFO L85 PathProgramCache]: Analyzing trace with hash -75182083, now seen corresponding path program 1 times [2025-03-03 14:16:03,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:03,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54869845] [2025-03-03 14:16:03,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:03,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:16:03,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:16:03,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,952 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-03 14:16:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54869845] [2025-03-03 14:16:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54869845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:03,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:03,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665443312] [2025-03-03 14:16:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:03,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:03,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:03,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:03,954 INFO L87 Difference]: Start difference. First operand 557 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:04,081 INFO L93 Difference]: Finished difference Result 1071 states and 1762 transitions. [2025-03-03 14:16:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:04,081 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-03 14:16:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:04,085 INFO L225 Difference]: With dead ends: 1071 [2025-03-03 14:16:04,085 INFO L226 Difference]: Without dead ends: 566 [2025-03-03 14:16:04,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:04,087 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 54 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4336 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:04,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4336 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-03 14:16:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-03-03 14:16:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 434 states have (on average 1.652073732718894) internal successors, (717), 455 states have internal predecessors, (717), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 908 transitions. [2025-03-03 14:16:04,103 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 908 transitions. Word has length 69 [2025-03-03 14:16:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:04,104 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 908 transitions. [2025-03-03 14:16:04,104 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 908 transitions. [2025-03-03 14:16:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:16:04,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:04,105 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-03 14:16:04,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:16:04,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:04,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash 72179752, now seen corresponding path program 1 times [2025-03-03 14:16:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152550713] [2025-03-03 14:16:04,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:04,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:16:04,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:16:04,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,198 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-03 14:16:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152550713] [2025-03-03 14:16:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152550713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:04,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824410916] [2025-03-03 14:16:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:04,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:04,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:04,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:04,200 INFO L87 Difference]: Start difference. First operand 557 states and 908 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:04,322 INFO L93 Difference]: Finished difference Result 1071 states and 1758 transitions. [2025-03-03 14:16:04,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:04,323 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-03 14:16:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:04,327 INFO L225 Difference]: With dead ends: 1071 [2025-03-03 14:16:04,327 INFO L226 Difference]: Without dead ends: 566 [2025-03-03 14:16:04,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:04,329 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 53 mSDsluCounter, 3446 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4318 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:04,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4318 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-03 14:16:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-03-03 14:16:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 434 states have (on average 1.6428571428571428) internal successors, (713), 455 states have internal predecessors, (713), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 904 transitions. [2025-03-03 14:16:04,345 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 904 transitions. Word has length 70 [2025-03-03 14:16:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:04,345 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 904 transitions. [2025-03-03 14:16:04,346 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 904 transitions. [2025-03-03 14:16:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:16:04,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:04,347 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-03 14:16:04,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:16:04,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:04,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:04,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1795493015, now seen corresponding path program 1 times [2025-03-03 14:16:04,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:04,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057311036] [2025-03-03 14:16:04,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:04,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:16:04,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:16:04,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,454 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-03 14:16:04,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:04,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057311036] [2025-03-03 14:16:04,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057311036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:04,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:04,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:04,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251258539] [2025-03-03 14:16:04,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:04,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:04,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:04,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:04,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:04,455 INFO L87 Difference]: Start difference. First operand 557 states and 904 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:04,509 INFO L93 Difference]: Finished difference Result 1062 states and 1740 transitions. [2025-03-03 14:16:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:04,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-03 14:16:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:04,513 INFO L225 Difference]: With dead ends: 1062 [2025-03-03 14:16:04,513 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:16:04,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:04,515 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 84 mSDsluCounter, 4392 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5285 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:04,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5285 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:16:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:16:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 413 states have (on average 1.6440677966101696) internal successors, (679), 434 states have internal predecessors, (679), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 870 transitions. [2025-03-03 14:16:04,528 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 870 transitions. Word has length 70 [2025-03-03 14:16:04,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:04,529 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 870 transitions. [2025-03-03 14:16:04,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 870 transitions. [2025-03-03 14:16:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:16:04,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:04,530 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-03 14:16:04,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:16:04,530 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:04,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:04,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1946120544, now seen corresponding path program 1 times [2025-03-03 14:16:04,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:04,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671884169] [2025-03-03 14:16:04,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:04,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:16:04,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:16:04,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,617 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-03 14:16:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671884169] [2025-03-03 14:16:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671884169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:04,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:04,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964480554] [2025-03-03 14:16:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:04,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:04,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:04,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:04,618 INFO L87 Difference]: Start difference. First operand 536 states and 870 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:04,679 INFO L93 Difference]: Finished difference Result 1041 states and 1706 transitions. [2025-03-03 14:16:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:04,679 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-03 14:16:04,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:04,683 INFO L225 Difference]: With dead ends: 1041 [2025-03-03 14:16:04,683 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:16:04,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:04,685 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 17 mSDsluCounter, 3403 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:04,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4256 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:16:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:16:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 413 states have (on average 1.6416464891041163) internal successors, (678), 434 states have internal predecessors, (678), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 869 transitions. [2025-03-03 14:16:04,701 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 869 transitions. Word has length 71 [2025-03-03 14:16:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:04,701 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 869 transitions. [2025-03-03 14:16:04,701 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 869 transitions. [2025-03-03 14:16:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:16:04,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:04,703 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-03 14:16:04,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:16:04,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:04,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1509434155, now seen corresponding path program 1 times [2025-03-03 14:16:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:04,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353580094] [2025-03-03 14:16:04,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:04,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:16:04,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:16:04,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,787 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-03 14:16:04,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:04,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353580094] [2025-03-03 14:16:04,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353580094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:04,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:04,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:04,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578435249] [2025-03-03 14:16:04,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:04,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:04,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:04,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:04,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:04,789 INFO L87 Difference]: Start difference. First operand 536 states and 869 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:04,844 INFO L93 Difference]: Finished difference Result 1041 states and 1705 transitions. [2025-03-03 14:16:04,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:04,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2025-03-03 14:16:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:04,848 INFO L225 Difference]: With dead ends: 1041 [2025-03-03 14:16:04,848 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:16:04,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:04,850 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 16 mSDsluCounter, 3403 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:04,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4256 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:16:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:16:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 413 states have (on average 1.639225181598063) internal successors, (677), 434 states have internal predecessors, (677), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 868 transitions. [2025-03-03 14:16:04,864 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 868 transitions. Word has length 72 [2025-03-03 14:16:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:04,865 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 868 transitions. [2025-03-03 14:16:04,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 868 transitions. [2025-03-03 14:16:04,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:16:04,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:04,866 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-03 14:16:04,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:16:04,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:04,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1837218109, now seen corresponding path program 1 times [2025-03-03 14:16:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:04,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443716554] [2025-03-03 14:16:04,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:04,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:16:04,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:16:04,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:05,023 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-03 14:16:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:05,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443716554] [2025-03-03 14:16:05,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443716554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:05,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:05,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:16:05,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545143801] [2025-03-03 14:16:05,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:05,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:16:05,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:05,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:16:05,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:05,025 INFO L87 Difference]: Start difference. First operand 536 states and 868 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:05,104 INFO L93 Difference]: Finished difference Result 1035 states and 1693 transitions. [2025-03-03 14:16:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:16:05,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 73 [2025-03-03 14:16:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:05,108 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 14:16:05,108 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:16:05,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:05,111 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 6 mSDsluCounter, 6794 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7646 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:05,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7646 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:16:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:16:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 413 states have (on average 1.6368038740920097) internal successors, (676), 434 states have internal predecessors, (676), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 867 transitions. [2025-03-03 14:16:05,128 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 867 transitions. Word has length 73 [2025-03-03 14:16:05,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:05,129 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 867 transitions. [2025-03-03 14:16:05,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 867 transitions. [2025-03-03 14:16:05,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:16:05,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:05,131 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-03 14:16:05,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:16:05,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:05,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:05,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2003270050, now seen corresponding path program 1 times [2025-03-03 14:16:05,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:05,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635815305] [2025-03-03 14:16:05,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:05,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:16:05,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:16:05,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:05,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:05,325 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-03 14:16:05,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:05,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635815305] [2025-03-03 14:16:05,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635815305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:05,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:05,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881238814] [2025-03-03 14:16:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:05,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:05,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:05,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:05,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:05,326 INFO L87 Difference]: Start difference. First operand 536 states and 867 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:16:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:07,206 INFO L93 Difference]: Finished difference Result 1666 states and 2758 transitions. [2025-03-03 14:16:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 74 [2025-03-03 14:16:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:07,214 INFO L225 Difference]: With dead ends: 1666 [2025-03-03 14:16:07,214 INFO L226 Difference]: Without dead ends: 1175 [2025-03-03 14:16:07,217 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-03 14:16:07,218 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 3268 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3335 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:07,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3335 Valid, 993 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:16:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-03-03 14:16:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1053. [2025-03-03 14:16:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 818 states have (on average 1.6577017114914425) internal successors, (1356), 848 states have internal predecessors, (1356), 190 states have call successors, (190), 43 states have call predecessors, (190), 44 states have return successors, (192), 174 states have call predecessors, (192), 185 states have call successors, (192) [2025-03-03 14:16:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1738 transitions. [2025-03-03 14:16:07,264 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1738 transitions. Word has length 74 [2025-03-03 14:16:07,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:07,264 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1738 transitions. [2025-03-03 14:16:07,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:16:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1738 transitions. [2025-03-03 14:16:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:16:07,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:07,268 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] [2025-03-03 14:16:07,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:16:07,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:07,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1285007324, now seen corresponding path program 1 times [2025-03-03 14:16:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637866158] [2025-03-03 14:16:07,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:07,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:16:07,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:16:07,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:07,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:07,582 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-03 14:16:07,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:07,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637866158] [2025-03-03 14:16:07,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637866158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:07,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:07,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:16:07,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282522706] [2025-03-03 14:16:07,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:07,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:16:07,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:07,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:16:07,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:07,583 INFO L87 Difference]: Start difference. First operand 1053 states and 1738 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:16:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:09,027 INFO L93 Difference]: Finished difference Result 2069 states and 3478 transitions. [2025-03-03 14:16:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:16:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 113 [2025-03-03 14:16:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:09,035 INFO L225 Difference]: With dead ends: 2069 [2025-03-03 14:16:09,035 INFO L226 Difference]: Without dead ends: 1061 [2025-03-03 14:16:09,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:09,039 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1313 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:09,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 1606 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:16:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-03 14:16:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2025-03-03 14:16:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 824 states have (on average 1.6529126213592233) internal successors, (1362), 854 states have internal predecessors, (1362), 190 states have call successors, (190), 43 states have call predecessors, (190), 46 states have return successors, (224), 176 states have call predecessors, (224), 185 states have call successors, (224) [2025-03-03 14:16:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1776 transitions. [2025-03-03 14:16:09,092 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1776 transitions. Word has length 113 [2025-03-03 14:16:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:09,092 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1776 transitions. [2025-03-03 14:16:09,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:16:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1776 transitions. [2025-03-03 14:16:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:16:09,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:09,095 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-03 14:16:09,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:16:09,096 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:09,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash -153340968, now seen corresponding path program 1 times [2025-03-03 14:16:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:09,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166176218] [2025-03-03 14:16:09,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:09,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:09,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:16:09,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:16:09,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:09,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:09,265 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-03 14:16:09,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:09,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166176218] [2025-03-03 14:16:09,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166176218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:09,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:09,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43815678] [2025-03-03 14:16:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:09,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:09,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:09,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:09,268 INFO L87 Difference]: Start difference. First operand 1061 states and 1776 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:16:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:12,038 INFO L93 Difference]: Finished difference Result 3923 states and 6737 transitions. [2025-03-03 14:16:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:16:12,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 114 [2025-03-03 14:16:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:12,055 INFO L225 Difference]: With dead ends: 3923 [2025-03-03 14:16:12,056 INFO L226 Difference]: Without dead ends: 2907 [2025-03-03 14:16:12,061 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-03 14:16:12,062 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 2411 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 4950 mSolverCounterSat, 632 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 5582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 4950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:12,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 2589 Invalid, 5582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [632 Valid, 4950 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 14:16:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2025-03-03 14:16:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2797. [2025-03-03 14:16:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2163 states have (on average 1.6500231160425336) internal successors, (3569), 2243 states have internal predecessors, (3569), 506 states have call successors, (506), 117 states have call predecessors, (506), 127 states have return successors, (581), 471 states have call predecessors, (581), 501 states have call successors, (581) [2025-03-03 14:16:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4656 transitions. [2025-03-03 14:16:12,213 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4656 transitions. Word has length 114 [2025-03-03 14:16:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:12,213 INFO L471 AbstractCegarLoop]: Abstraction has 2797 states and 4656 transitions. [2025-03-03 14:16:12,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:16:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4656 transitions. [2025-03-03 14:16:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:16:12,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:12,217 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] [2025-03-03 14:16:12,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:16:12,217 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1897759725, now seen corresponding path program 1 times [2025-03-03 14:16:12,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:12,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294106277] [2025-03-03 14:16:12,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:12,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:12,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:16:12,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:16:12,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:12,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:12,450 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-03 14:16:12,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294106277] [2025-03-03 14:16:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294106277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:12,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 14:16:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713431627] [2025-03-03 14:16:12,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:12,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:16:12,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:12,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:16:12,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:16:12,453 INFO L87 Difference]: Start difference. First operand 2797 states and 4656 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 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-03 14:16:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:15,812 INFO L93 Difference]: Finished difference Result 8855 states and 14709 transitions. [2025-03-03 14:16:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:16:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 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-03 14:16:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:15,839 INFO L225 Difference]: With dead ends: 8855 [2025-03-03 14:16:15,839 INFO L226 Difference]: Without dead ends: 6103 [2025-03-03 14:16:15,851 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-03 14:16:15,851 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 2954 mSDsluCounter, 3834 mSDsCounter, 0 mSdLazyCounter, 9001 mSolverCounterSat, 1014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3032 SdHoareTripleChecker+Valid, 4597 SdHoareTripleChecker+Invalid, 10015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1014 IncrementalHoareTripleChecker+Valid, 9001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:15,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3032 Valid, 4597 Invalid, 10015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1014 Valid, 9001 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 14:16:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6103 states. [2025-03-03 14:16:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6103 to 5935. [2025-03-03 14:16:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5935 states, 4461 states have (on average 1.6112979152656355) internal successors, (7188), 4642 states have internal predecessors, (7188), 1204 states have call successors, (1204), 237 states have call predecessors, (1204), 269 states have return successors, (1389), 1132 states have call predecessors, (1389), 1199 states have call successors, (1389) [2025-03-03 14:16:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5935 states to 5935 states and 9781 transitions. [2025-03-03 14:16:16,119 INFO L78 Accepts]: Start accepts. Automaton has 5935 states and 9781 transitions. Word has length 115 [2025-03-03 14:16:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:16,119 INFO L471 AbstractCegarLoop]: Abstraction has 5935 states and 9781 transitions. [2025-03-03 14:16:16,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 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-03 14:16:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 5935 states and 9781 transitions. [2025-03-03 14:16:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:16:16,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:16,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:16,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:16:16,122 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:16,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1229431506, now seen corresponding path program 1 times [2025-03-03 14:16:16,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:16,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194610341] [2025-03-03 14:16:16,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:16,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:16:16,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:16:16,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:16,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:16,257 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-03 14:16:16,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:16,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194610341] [2025-03-03 14:16:16,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194610341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:16,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:16,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:16,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33184883] [2025-03-03 14:16:16,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:16,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:16,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:16,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:16,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:16,260 INFO L87 Difference]: Start difference. First operand 5935 states and 9781 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:16:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:18,416 INFO L93 Difference]: Finished difference Result 16869 states and 28269 transitions. [2025-03-03 14:16:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:18,417 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 116 [2025-03-03 14:16:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:18,472 INFO L225 Difference]: With dead ends: 16869 [2025-03-03 14:16:18,473 INFO L226 Difference]: Without dead ends: 10975 [2025-03-03 14:16:18,500 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-03 14:16:18,500 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 3260 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 880 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3296 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 4200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 880 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:18,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3296 Valid, 1827 Invalid, 4200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [880 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:16:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10975 states. [2025-03-03 14:16:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10975 to 9480. [2025-03-03 14:16:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9480 states, 6980 states have (on average 1.5974212034383954) internal successors, (11150), 7318 states have internal predecessors, (11150), 2070 states have call successors, (2070), 360 states have call predecessors, (2070), 429 states have return successors, (2408), 1997 states have call predecessors, (2408), 2065 states have call successors, (2408) [2025-03-03 14:16:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9480 states to 9480 states and 15628 transitions. [2025-03-03 14:16:18,961 INFO L78 Accepts]: Start accepts. Automaton has 9480 states and 15628 transitions. Word has length 116 [2025-03-03 14:16:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:18,962 INFO L471 AbstractCegarLoop]: Abstraction has 9480 states and 15628 transitions. [2025-03-03 14:16:18,962 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:16:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states and 15628 transitions. [2025-03-03 14:16:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:16:18,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:18,965 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-03 14:16:18,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:16:18,965 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:18,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1002522179, now seen corresponding path program 1 times [2025-03-03 14:16:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455584774] [2025-03-03 14:16:18,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:18,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:16:18,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:16:18,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:18,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:19,134 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-03 14:16:19,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:19,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455584774] [2025-03-03 14:16:19,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455584774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:19,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:19,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:19,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285472210] [2025-03-03 14:16:19,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:19,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:19,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:19,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:19,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:19,136 INFO L87 Difference]: Start difference. First operand 9480 states and 15628 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:16:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:21,901 INFO L93 Difference]: Finished difference Result 30662 states and 51746 transitions. [2025-03-03 14:16:21,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:21,902 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 117 [2025-03-03 14:16:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:21,993 INFO L225 Difference]: With dead ends: 30662 [2025-03-03 14:16:21,993 INFO L226 Difference]: Without dead ends: 21230 [2025-03-03 14:16:22,026 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-03 14:16:22,028 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 3273 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 3281 mSolverCounterSat, 904 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3310 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 4185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 3281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:22,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3310 Valid, 1840 Invalid, 4185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 3281 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:16:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21230 states. [2025-03-03 14:16:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21230 to 18342. [2025-03-03 14:16:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18342 states, 13174 states have (on average 1.584332776681342) internal successors, (20872), 13912 states have internal predecessors, (20872), 4359 states have call successors, (4359), 608 states have call predecessors, (4359), 808 states have return successors, (5177), 4318 states have call predecessors, (5177), 4354 states have call successors, (5177) [2025-03-03 14:16:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18342 states to 18342 states and 30408 transitions. [2025-03-03 14:16:22,994 INFO L78 Accepts]: Start accepts. Automaton has 18342 states and 30408 transitions. Word has length 117 [2025-03-03 14:16:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:22,995 INFO L471 AbstractCegarLoop]: Abstraction has 18342 states and 30408 transitions. [2025-03-03 14:16:22,995 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:16:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 18342 states and 30408 transitions. [2025-03-03 14:16:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:16:22,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:22,998 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-03 14:16:22,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:16:22,998 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1525131789, now seen corresponding path program 1 times [2025-03-03 14:16:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823991563] [2025-03-03 14:16:22,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:23,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:16:23,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:16:23,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:23,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:23,206 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-03 14:16:23,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:23,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823991563] [2025-03-03 14:16:23,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823991563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:23,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:23,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:23,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443774049] [2025-03-03 14:16:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:23,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:23,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:23,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:23,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:23,209 INFO L87 Difference]: Start difference. First operand 18342 states and 30408 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:16:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:27,562 INFO L93 Difference]: Finished difference Result 67273 states and 114517 transitions. [2025-03-03 14:16:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:27,563 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 118 [2025-03-03 14:16:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:27,872 INFO L225 Difference]: With dead ends: 67273 [2025-03-03 14:16:27,872 INFO L226 Difference]: Without dead ends: 48981 [2025-03-03 14:16:27,954 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-03 14:16:27,955 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 3285 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 3288 mSolverCounterSat, 907 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3323 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 3288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:27,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3323 Valid, 1861 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 3288 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 14:16:27,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48981 states. [2025-03-03 14:16:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48981 to 41630. [2025-03-03 14:16:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41630 states, 29256 states have (on average 1.5765313098167897) internal successors, (46123), 31052 states have internal predecessors, (46123), 10614 states have call successors, (10614), 1104 states have call predecessors, (10614), 1759 states have return successors, (12976), 10747 states have call predecessors, (12976), 10609 states have call successors, (12976) [2025-03-03 14:16:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41630 states to 41630 states and 69713 transitions. [2025-03-03 14:16:30,993 INFO L78 Accepts]: Start accepts. Automaton has 41630 states and 69713 transitions. Word has length 118 [2025-03-03 14:16:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:30,994 INFO L471 AbstractCegarLoop]: Abstraction has 41630 states and 69713 transitions. [2025-03-03 14:16:30,994 INFO L472 AbstractCegarLoop]: INTERPOLANT 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:16:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 41630 states and 69713 transitions. [2025-03-03 14:16:30,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:16:30,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:30,998 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-03 14:16:30,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:16:30,998 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:30,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash 486975330, now seen corresponding path program 1 times [2025-03-03 14:16:30,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:30,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544475014] [2025-03-03 14:16:30,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:31,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:16:31,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:16:31,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:31,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:31,151 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-03 14:16:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544475014] [2025-03-03 14:16:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544475014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818078360] [2025-03-03 14:16:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:31,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:31,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:31,154 INFO L87 Difference]: Start difference. First operand 41630 states and 69713 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:16:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:40,762 INFO L93 Difference]: Finished difference Result 169024 states and 290469 transitions. [2025-03-03 14:16:40,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:40,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 119 [2025-03-03 14:16:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:41,557 INFO L225 Difference]: With dead ends: 169024 [2025-03-03 14:16:41,558 INFO L226 Difference]: Without dead ends: 127448 [2025-03-03 14:16:41,758 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-03 14:16:41,759 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 3297 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 3297 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 4206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 3297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:41,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3336 Valid, 1882 Invalid, 4206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 3297 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:16:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127448 states.