./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_spec9_product30.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:19:02,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:19:02,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:19:02,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:19:02,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:19:02,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:19:02,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:19:02,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:19:02,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:19:02,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:19:02,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:19:02,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:19:02,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:19:02,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:19:02,202 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:19:02,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:19:02,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:19:02,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:19:02,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:19:02,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:19:02,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:19:02,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:19:02,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:19:02,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:19:02,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:19:02,204 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:19:02,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:19:02,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:19:02,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:19:02,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:19:02,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:19:02,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:19:02,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:19:02,205 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e [2025-03-03 14:19:02,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:19:02,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:19:02,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:19:02,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:19:02,508 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:19:02,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2025-03-03 14:19:03,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4416d5b29/e497790c86b145f8b04f9930226bb1d3/FLAGbfc2608b6 [2025-03-03 14:19:03,995 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:19:03,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2025-03-03 14:19:04,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4416d5b29/e497790c86b145f8b04f9930226bb1d3/FLAGbfc2608b6 [2025-03-03 14:19:04,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4416d5b29/e497790c86b145f8b04f9930226bb1d3 [2025-03-03 14:19:04,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:19:04,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:19:04,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:19:04,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:19:04,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:19:04,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45081f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04, skipping insertion in model container [2025-03-03 14:19:04,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:19:04,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c[11768,11781] [2025-03-03 14:19:04,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:19:04,595 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:19:04,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-03 14:19:04,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [414] [2025-03-03 14:19:04,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [452] [2025-03-03 14:19:04,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [461] [2025-03-03 14:19:04,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [626] [2025-03-03 14:19:04,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [640] [2025-03-03 14:19:04,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [739] [2025-03-03 14:19:04,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [859] [2025-03-03 14:19:04,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2444] [2025-03-03 14:19:04,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3105] [2025-03-03 14:19:04,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c[11768,11781] [2025-03-03 14:19:04,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:19:04,714 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:19:04,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04 WrapperNode [2025-03-03 14:19:04,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:19:04,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:19:04,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:19:04,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:19:04,721 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:19:04" (1/1) ... [2025-03-03 14:19:04,735 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:19:04" (1/1) ... [2025-03-03 14:19:04,761 INFO L138 Inliner]: procedures = 95, calls = 344, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 869 [2025-03-03 14:19:04,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:19:04,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:19:04,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:19:04,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:19:04,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,812 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:19:04,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,825 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:19:04,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:19:04,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:19:04,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:19:04,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (1/1) ... [2025-03-03 14:19:04,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:19:04,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:04,872 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:19:04,874 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:19:04,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:19:04,893 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:19:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:19:04,893 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:19:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:19:04,893 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:19:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:19:04,893 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:19:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:19:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:19:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:19:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:19:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:19:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:19:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:19:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:19:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:19:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:19:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:19:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-03 14:19:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:19:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:19:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:19:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:19:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:19:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-03-03 14:19:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:19:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:19:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:19:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:19:05,026 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:19:05,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:19:05,070 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L856: #res := ~retValue_acc~7; [2025-03-03 14:19:05,091 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L778: #res := ~retValue_acc~5; [2025-03-03 14:19:05,094 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: #res := ~retValue_acc~8; [2025-03-03 14:19:05,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: #res := ~retValue_acc~9; [2025-03-03 14:19:05,282 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~18#1; [2025-03-03 14:19:05,282 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1690: #res#1 := ~retValue_acc~17#1; [2025-03-03 14:19:05,346 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822: #res := ~retValue_acc~21; [2025-03-03 14:19:05,362 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: #res := ~retValue_acc~6; [2025-03-03 14:19:05,386 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1206: #res := ~retValue_acc~13; [2025-03-03 14:19:05,529 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1651: #res := ~retValue_acc~16; [2025-03-03 14:19:05,539 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1157: #res := ~retValue_acc~11; [2025-03-03 14:19:05,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1299-1: isIdle_#res#1 := isIdle_~retValue_acc~15#1; [2025-03-03 14:19:05,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1286-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; [2025-03-03 14:19:05,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: #res := ~retValue_acc~24; [2025-03-03 14:19:05,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1780-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~19#1; [2025-03-03 14:19:05,818 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-03-03 14:19:05,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3452-1: main_#res#1 := main_~retValue_acc~27#1; [2025-03-03 14:19:05,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L449-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-03-03 14:19:05,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555: #res := ~retValue_acc~23; [2025-03-03 14:19:05,888 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1123: #res := ~retValue_acc~10; [2025-03-03 14:19:05,891 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3102: #res := ~retValue_acc~25; [2025-03-03 14:19:05,999 INFO L? ?]: Removed 455 outVars from TransFormulas that were not future-live. [2025-03-03 14:19:06,000 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:19:06,015 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:19:06,015 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:19:06,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:19:06 BoogieIcfgContainer [2025-03-03 14:19:06,015 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:19:06,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:19:06,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:19:06,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:19:06,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:19:04" (1/3) ... [2025-03-03 14:19:06,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ad07f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:19:06, skipping insertion in model container [2025-03-03 14:19:06,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:04" (2/3) ... [2025-03-03 14:19:06,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ad07f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:19:06, skipping insertion in model container [2025-03-03 14:19:06,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:19:06" (3/3) ... [2025-03-03 14:19:06,021 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2025-03-03 14:19:06,030 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:19:06,032 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product30.cil.c that has 27 procedures, 575 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:19:06,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:19:06,107 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;@76775b57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:19:06,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:19:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 575 states, 451 states have (on average 1.6917960088691797) internal successors, (763), 474 states have internal predecessors, (763), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 14:19:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:19:06,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:06,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:06,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:06,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash -166531787, now seen corresponding path program 1 times [2025-03-03 14:19:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548486008] [2025-03-03 14:19:06,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:06,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:06,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:19:06,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:19:06,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:06,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:06,536 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:19:06,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:06,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548486008] [2025-03-03 14:19:06,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548486008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:06,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:06,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:06,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37753693] [2025-03-03 14:19:06,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:06,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:06,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:06,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:06,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:06,558 INFO L87 Difference]: Start difference. First operand has 575 states, 451 states have (on average 1.6917960088691797) internal successors, (763), 474 states have internal predecessors, (763), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:06,673 INFO L93 Difference]: Finished difference Result 1130 states and 1885 transitions. [2025-03-03 14:19:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:06,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2025-03-03 14:19:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:06,694 INFO L225 Difference]: With dead ends: 1130 [2025-03-03 14:19:06,695 INFO L226 Difference]: Without dead ends: 567 [2025-03-03 14:19:06,701 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:19:06,703 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 5 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2801 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:19:06,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2801 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-03 14:19:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-03-03 14:19:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6898876404494383) internal successors, (752), 466 states have internal predecessors, (752), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 939 transitions. [2025-03-03 14:19:06,769 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 939 transitions. Word has length 62 [2025-03-03 14:19:06,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:06,769 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 939 transitions. [2025-03-03 14:19:06,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 939 transitions. [2025-03-03 14:19:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:19:06,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:06,776 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:19:06,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:19:06,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:06,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash 721815425, now seen corresponding path program 1 times [2025-03-03 14:19:06,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:06,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198152281] [2025-03-03 14:19:06,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:06,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:06,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:19:06,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:19:06,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:06,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:06,942 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:19:06,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:06,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198152281] [2025-03-03 14:19:06,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198152281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:06,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:06,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:06,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973824126] [2025-03-03 14:19:06,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:06,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:06,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:06,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:06,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:06,946 INFO L87 Difference]: Start difference. First operand 567 states and 939 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:07,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:07,010 INFO L93 Difference]: Finished difference Result 1116 states and 1855 transitions. [2025-03-03 14:19:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:07,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2025-03-03 14:19:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:07,016 INFO L225 Difference]: With dead ends: 1116 [2025-03-03 14:19:07,016 INFO L226 Difference]: Without dead ends: 567 [2025-03-03 14:19:07,019 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:19:07,020 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 4 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2780 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:19:07,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2780 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-03 14:19:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-03-03 14:19:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6876404494382022) internal successors, (751), 466 states have internal predecessors, (751), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 938 transitions. [2025-03-03 14:19:07,049 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 938 transitions. Word has length 65 [2025-03-03 14:19:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:07,049 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 938 transitions. [2025-03-03 14:19:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 938 transitions. [2025-03-03 14:19:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:19:07,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:07,053 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:19:07,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:19:07,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:07,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash 237147087, now seen corresponding path program 1 times [2025-03-03 14:19:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:07,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933298690] [2025-03-03 14:19:07,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:07,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:07,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:19:07,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:19:07,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:07,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:07,194 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:19:07,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933298690] [2025-03-03 14:19:07,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933298690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:07,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:07,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:07,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865578202] [2025-03-03 14:19:07,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:07,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:07,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:07,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:07,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:07,196 INFO L87 Difference]: Start difference. First operand 567 states and 938 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:07,240 INFO L93 Difference]: Finished difference Result 1116 states and 1854 transitions. [2025-03-03 14:19:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:07,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2025-03-03 14:19:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:07,244 INFO L225 Difference]: With dead ends: 1116 [2025-03-03 14:19:07,244 INFO L226 Difference]: Without dead ends: 567 [2025-03-03 14:19:07,246 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:19:07,246 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 3 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2780 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:19:07,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2780 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-03 14:19:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-03-03 14:19:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6853932584269662) internal successors, (750), 466 states have internal predecessors, (750), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 937 transitions. [2025-03-03 14:19:07,263 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 937 transitions. Word has length 66 [2025-03-03 14:19:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:07,263 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 937 transitions. [2025-03-03 14:19:07,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 937 transitions. [2025-03-03 14:19:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:19:07,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:07,264 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:19:07,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:19:07,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:07,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1577400162, now seen corresponding path program 1 times [2025-03-03 14:19:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:07,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546424906] [2025-03-03 14:19:07,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:07,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:19:07,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:19:07,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:07,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:07,348 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:19:07,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:07,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546424906] [2025-03-03 14:19:07,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546424906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:07,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:07,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:07,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480436153] [2025-03-03 14:19:07,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:07,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:07,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:07,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:07,350 INFO L87 Difference]: Start difference. First operand 567 states and 937 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:07,390 INFO L93 Difference]: Finished difference Result 1116 states and 1853 transitions. [2025-03-03 14:19:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:07,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2025-03-03 14:19:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:07,395 INFO L225 Difference]: With dead ends: 1116 [2025-03-03 14:19:07,395 INFO L226 Difference]: Without dead ends: 567 [2025-03-03 14:19:07,397 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:19:07,398 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 2 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2780 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:19:07,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2780 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-03 14:19:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-03-03 14:19:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6831460674157304) internal successors, (749), 466 states have internal predecessors, (749), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 936 transitions. [2025-03-03 14:19:07,413 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 936 transitions. Word has length 67 [2025-03-03 14:19:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:07,413 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 936 transitions. [2025-03-03 14:19:07,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 936 transitions. [2025-03-03 14:19:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:19:07,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:07,415 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:19:07,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:19:07,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:07,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:07,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1668520692, now seen corresponding path program 1 times [2025-03-03 14:19:07,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:07,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297844235] [2025-03-03 14:19:07,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:07,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:07,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:19:07,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:19:07,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:07,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:07,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:19:07,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:07,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297844235] [2025-03-03 14:19:07,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297844235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:07,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:07,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:07,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762399377] [2025-03-03 14:19:07,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:07,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:07,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:07,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:07,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:07,532 INFO L87 Difference]: Start difference. First operand 567 states and 936 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:07,569 INFO L93 Difference]: Finished difference Result 1116 states and 1852 transitions. [2025-03-03 14:19:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:07,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-03-03 14:19:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:07,574 INFO L225 Difference]: With dead ends: 1116 [2025-03-03 14:19:07,574 INFO L226 Difference]: Without dead ends: 567 [2025-03-03 14:19:07,576 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:19:07,578 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 1 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2780 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:19:07,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2780 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-03 14:19:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-03-03 14:19:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6808988764044943) internal successors, (748), 466 states have internal predecessors, (748), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 935 transitions. [2025-03-03 14:19:07,602 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 935 transitions. Word has length 68 [2025-03-03 14:19:07,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:07,603 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 935 transitions. [2025-03-03 14:19:07,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 935 transitions. [2025-03-03 14:19:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:19:07,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:07,605 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:19:07,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:19:07,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:07,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 126979515, now seen corresponding path program 1 times [2025-03-03 14:19:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:07,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432467670] [2025-03-03 14:19:07,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:07,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:07,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:19:07,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:19:07,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:07,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:07,825 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:19:07,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:07,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432467670] [2025-03-03 14:19:07,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432467670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:07,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:07,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:19:07,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420153437] [2025-03-03 14:19:07,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:07,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:19:07,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:07,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:19:07,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:07,829 INFO L87 Difference]: Start difference. First operand 567 states and 935 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:07,939 INFO L93 Difference]: Finished difference Result 1082 states and 1784 transitions. [2025-03-03 14:19:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:19:07,939 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-03-03 14:19:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:07,944 INFO L225 Difference]: With dead ends: 1082 [2025-03-03 14:19:07,944 INFO L226 Difference]: Without dead ends: 582 [2025-03-03 14:19:07,946 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:19:07,947 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 91 mSDsluCounter, 6378 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7301 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:19:07,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7301 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-03 14:19:07,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2025-03-03 14:19:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 455 states have (on average 1.676923076923077) internal successors, (763), 478 states have internal predecessors, (763), 97 states have call successors, (97), 26 states have call predecessors, (97), 27 states have return successors, (94), 89 states have call predecessors, (94), 92 states have call successors, (94) [2025-03-03 14:19:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 954 transitions. [2025-03-03 14:19:07,979 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 954 transitions. Word has length 69 [2025-03-03 14:19:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:07,979 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 954 transitions. [2025-03-03 14:19:07,979 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 954 transitions. [2025-03-03 14:19:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:19:07,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:07,981 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:19:07,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:19:07,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:07,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash 896149530, now seen corresponding path program 1 times [2025-03-03 14:19:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:07,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63181625] [2025-03-03 14:19:07,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:07,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:07,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:19:08,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:19:08,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:08,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:08,055 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:19:08,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:08,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63181625] [2025-03-03 14:19:08,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63181625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:08,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804365380] [2025-03-03 14:19:08,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:08,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:08,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:08,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:08,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:08,057 INFO L87 Difference]: Start difference. First operand 580 states and 954 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:08,089 INFO L93 Difference]: Finished difference Result 1134 states and 1878 transitions. [2025-03-03 14:19:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:08,090 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2025-03-03 14:19:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:08,094 INFO L225 Difference]: With dead ends: 1134 [2025-03-03 14:19:08,094 INFO L226 Difference]: Without dead ends: 561 [2025-03-03 14:19:08,096 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:19:08,096 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 0 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2782 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:19:08,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2782 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-03 14:19:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-03-03 14:19:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.671981776765376) internal successors, (734), 460 states have internal predecessors, (734), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 921 transitions. [2025-03-03 14:19:08,116 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 921 transitions. Word has length 69 [2025-03-03 14:19:08,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:08,116 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 921 transitions. [2025-03-03 14:19:08,117 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 921 transitions. [2025-03-03 14:19:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:19:08,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:08,120 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:19:08,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:19:08,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:08,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1213429986, now seen corresponding path program 1 times [2025-03-03 14:19:08,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:08,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172107504] [2025-03-03 14:19:08,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:08,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:19:08,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:19:08,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:08,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:08,230 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:19:08,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172107504] [2025-03-03 14:19:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172107504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:08,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488658855] [2025-03-03 14:19:08,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:08,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:08,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:08,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:08,232 INFO L87 Difference]: Start difference. First operand 561 states and 921 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:08,375 INFO L93 Difference]: Finished difference Result 1079 states and 1776 transitions. [2025-03-03 14:19:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:08,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2025-03-03 14:19:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:08,380 INFO L225 Difference]: With dead ends: 1079 [2025-03-03 14:19:08,380 INFO L226 Difference]: Without dead ends: 570 [2025-03-03 14:19:08,382 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:19:08,383 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 55 mSDsluCounter, 3483 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4361 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:19:08,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4361 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-03 14:19:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 561. [2025-03-03 14:19:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.6628701594533029) internal successors, (730), 460 states have internal predecessors, (730), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 917 transitions. [2025-03-03 14:19:08,402 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 917 transitions. Word has length 70 [2025-03-03 14:19:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:08,402 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 917 transitions. [2025-03-03 14:19:08,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 917 transitions. [2025-03-03 14:19:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:19:08,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:08,404 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:19:08,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:19:08,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:08,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1816535474, now seen corresponding path program 1 times [2025-03-03 14:19:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:08,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072925974] [2025-03-03 14:19:08,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:08,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:08,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:19:08,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:19:08,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:08,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:08,511 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:19:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072925974] [2025-03-03 14:19:08,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072925974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:08,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:08,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225968618] [2025-03-03 14:19:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:08,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:08,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:08,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:08,513 INFO L87 Difference]: Start difference. First operand 561 states and 917 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:08,666 INFO L93 Difference]: Finished difference Result 1079 states and 1772 transitions. [2025-03-03 14:19:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:08,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-03-03 14:19:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:08,670 INFO L225 Difference]: With dead ends: 1079 [2025-03-03 14:19:08,670 INFO L226 Difference]: Without dead ends: 570 [2025-03-03 14:19:08,672 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:19:08,672 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 54 mSDsluCounter, 3483 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4361 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:19:08,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4361 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-03 14:19:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 561. [2025-03-03 14:19:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.65375854214123) internal successors, (726), 460 states have internal predecessors, (726), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 913 transitions. [2025-03-03 14:19:08,690 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 913 transitions. Word has length 71 [2025-03-03 14:19:08,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:08,691 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 913 transitions. [2025-03-03 14:19:08,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 913 transitions. [2025-03-03 14:19:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:19:08,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:08,692 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:19:08,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:19:08,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:08,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:08,693 INFO L85 PathProgramCache]: Analyzing trace with hash -296076763, now seen corresponding path program 1 times [2025-03-03 14:19:08,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:08,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195563833] [2025-03-03 14:19:08,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:08,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:08,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:19:08,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:19:08,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:08,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:08,800 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:19:08,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195563833] [2025-03-03 14:19:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195563833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:08,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:08,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71387476] [2025-03-03 14:19:08,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:08,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:08,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:08,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:08,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:08,802 INFO L87 Difference]: Start difference. First operand 561 states and 913 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:08,935 INFO L93 Difference]: Finished difference Result 1079 states and 1768 transitions. [2025-03-03 14:19:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:08,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-03-03 14:19:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:08,940 INFO L225 Difference]: With dead ends: 1079 [2025-03-03 14:19:08,940 INFO L226 Difference]: Without dead ends: 570 [2025-03-03 14:19:08,942 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:19:08,943 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 53 mSDsluCounter, 3466 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4343 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:19:08,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4343 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-03 14:19:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 561. [2025-03-03 14:19:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.644646924829157) internal successors, (722), 460 states have internal predecessors, (722), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 909 transitions. [2025-03-03 14:19:08,959 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 909 transitions. Word has length 72 [2025-03-03 14:19:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:08,959 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 909 transitions. [2025-03-03 14:19:08,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 909 transitions. [2025-03-03 14:19:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:19:08,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:08,960 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:19:08,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:19:08,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:08,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2049407276, now seen corresponding path program 1 times [2025-03-03 14:19:08,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:08,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993469009] [2025-03-03 14:19:08,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:08,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:19:08,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:19:08,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:08,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:09,082 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:19:09,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:09,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993469009] [2025-03-03 14:19:09,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993469009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:09,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:09,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:19:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937088030] [2025-03-03 14:19:09,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:09,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:19:09,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:09,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:19:09,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:09,084 INFO L87 Difference]: Start difference. First operand 561 states and 909 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:09,140 INFO L93 Difference]: Finished difference Result 1070 states and 1750 transitions. [2025-03-03 14:19:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:19:09,141 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 72 [2025-03-03 14:19:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:09,145 INFO L225 Difference]: With dead ends: 1070 [2025-03-03 14:19:09,145 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 14:19:09,147 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:19:09,147 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 84 mSDsluCounter, 4417 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5315 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:19:09,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5315 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 14:19:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-03-03 14:19:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.645933014354067) internal successors, (688), 439 states have internal predecessors, (688), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 875 transitions. [2025-03-03 14:19:09,161 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 875 transitions. Word has length 72 [2025-03-03 14:19:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:09,161 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 875 transitions. [2025-03-03 14:19:09,161 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 875 transitions. [2025-03-03 14:19:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:19:09,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:09,162 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:19:09,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:19:09,163 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:09,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash -696592555, now seen corresponding path program 1 times [2025-03-03 14:19:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:09,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090582614] [2025-03-03 14:19:09,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:09,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:19:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:19:09,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:09,251 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:19:09,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:09,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090582614] [2025-03-03 14:19:09,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090582614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:09,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:09,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:09,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995044446] [2025-03-03 14:19:09,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:09,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:09,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:09,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:09,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:09,253 INFO L87 Difference]: Start difference. First operand 540 states and 875 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:09,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:09,310 INFO L93 Difference]: Finished difference Result 1049 states and 1716 transitions. [2025-03-03 14:19:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:09,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-03 14:19:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:09,314 INFO L225 Difference]: With dead ends: 1049 [2025-03-03 14:19:09,314 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 14:19:09,316 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:19:09,316 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 17 mSDsluCounter, 3423 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4281 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:19:09,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4281 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 14:19:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-03-03 14:19:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.6435406698564594) internal successors, (687), 439 states have internal predecessors, (687), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 874 transitions. [2025-03-03 14:19:09,331 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 874 transitions. Word has length 73 [2025-03-03 14:19:09,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:09,331 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 874 transitions. [2025-03-03 14:19:09,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 874 transitions. [2025-03-03 14:19:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:19:09,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:09,333 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:19:09,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:19:09,333 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:09,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:09,334 INFO L85 PathProgramCache]: Analyzing trace with hash 438273896, now seen corresponding path program 1 times [2025-03-03 14:19:09,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:09,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546947723] [2025-03-03 14:19:09,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:09,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:09,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:19:09,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:19:09,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:09,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:09,431 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:19:09,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546947723] [2025-03-03 14:19:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546947723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181899642] [2025-03-03 14:19:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:09,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:09,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:09,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:09,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:09,433 INFO L87 Difference]: Start difference. First operand 540 states and 874 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:09,496 INFO L93 Difference]: Finished difference Result 1049 states and 1715 transitions. [2025-03-03 14:19:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:09,497 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-03 14:19:09,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:09,501 INFO L225 Difference]: With dead ends: 1049 [2025-03-03 14:19:09,501 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 14:19:09,503 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:19:09,504 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 16 mSDsluCounter, 3423 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4281 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:19:09,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4281 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 14:19:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-03-03 14:19:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.6411483253588517) internal successors, (686), 439 states have internal predecessors, (686), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 873 transitions. [2025-03-03 14:19:09,523 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 873 transitions. Word has length 74 [2025-03-03 14:19:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:09,523 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 873 transitions. [2025-03-03 14:19:09,523 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 873 transitions. [2025-03-03 14:19:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:19:09,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:09,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:09,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:19:09,526 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:09,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1925349624, now seen corresponding path program 1 times [2025-03-03 14:19:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:09,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119443310] [2025-03-03 14:19:09,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:09,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:19:09,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:19:09,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:09,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:09,699 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:19:09,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:09,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119443310] [2025-03-03 14:19:09,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119443310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:09,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:09,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:19:09,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629753536] [2025-03-03 14:19:09,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:09,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:19:09,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:09,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:19:09,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:09,701 INFO L87 Difference]: Start difference. First operand 540 states and 873 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:09,783 INFO L93 Difference]: Finished difference Result 1043 states and 1703 transitions. [2025-03-03 14:19:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:19:09,784 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-03 14:19:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:09,788 INFO L225 Difference]: With dead ends: 1043 [2025-03-03 14:19:09,788 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 14:19:09,790 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:19:09,791 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 6 mSDsluCounter, 6834 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7691 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:19:09,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7691 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 14:19:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-03-03 14:19:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.638755980861244) internal successors, (685), 439 states have internal predecessors, (685), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:19:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 872 transitions. [2025-03-03 14:19:09,808 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 872 transitions. Word has length 75 [2025-03-03 14:19:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:09,808 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 872 transitions. [2025-03-03 14:19:09,808 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, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 872 transitions. [2025-03-03 14:19:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:19:09,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:09,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:09,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:19:09,821 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:09,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1159686363, now seen corresponding path program 1 times [2025-03-03 14:19:09,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:09,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504491832] [2025-03-03 14:19:09,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:09,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:09,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:19:09,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:19:09,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:09,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:10,009 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:19:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:10,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504491832] [2025-03-03 14:19:10,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504491832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:10,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:10,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129392640] [2025-03-03 14:19:10,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:10,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:10,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:10,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:10,011 INFO L87 Difference]: Start difference. First operand 540 states and 872 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, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-03 14:19:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:11,869 INFO L93 Difference]: Finished difference Result 1665 states and 2751 transitions. [2025-03-03 14:19:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:11,870 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, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 76 [2025-03-03 14:19:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:11,878 INFO L225 Difference]: With dead ends: 1665 [2025-03-03 14:19:11,878 INFO L226 Difference]: Without dead ends: 1170 [2025-03-03 14:19:11,880 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:19:11,880 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 3255 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3319 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:11,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3319 Valid, 951 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:19:11,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-03-03 14:19:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1038. [2025-03-03 14:19:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 811 states have (on average 1.6596794081381012) internal successors, (1346), 841 states have internal predecessors, (1346), 179 states have call successors, (179), 46 states have call predecessors, (179), 47 states have return successors, (181), 163 states have call predecessors, (181), 174 states have call successors, (181) [2025-03-03 14:19:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1706 transitions. [2025-03-03 14:19:11,924 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1706 transitions. Word has length 76 [2025-03-03 14:19:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:11,924 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1706 transitions. [2025-03-03 14:19:11,924 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, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-03 14:19:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1706 transitions. [2025-03-03 14:19:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:19:11,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:11,928 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:19:11,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:19:11,928 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:11,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash 588347002, now seen corresponding path program 1 times [2025-03-03 14:19:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:11,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003369041] [2025-03-03 14:19:11,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:11,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:19:11,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:19:11,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:12,190 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:19:12,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:12,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003369041] [2025-03-03 14:19:12,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003369041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:12,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:12,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 14:19:12,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796961597] [2025-03-03 14:19:12,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:12,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:19:12,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:12,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:19:12,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:19:12,192 INFO L87 Difference]: Start difference. First operand 1038 states and 1706 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:19:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:16,419 INFO L93 Difference]: Finished difference Result 3756 states and 6200 transitions. [2025-03-03 14:19:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:19:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 114 [2025-03-03 14:19:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:16,435 INFO L225 Difference]: With dead ends: 3756 [2025-03-03 14:19:16,435 INFO L226 Difference]: Without dead ends: 2763 [2025-03-03 14:19:16,441 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:19:16,442 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 2795 mSDsluCounter, 3533 mSDsCounter, 0 mSdLazyCounter, 9765 mSolverCounterSat, 901 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2870 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 10666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 901 IncrementalHoareTripleChecker+Valid, 9765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:16,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2870 Valid, 4227 Invalid, 10666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [901 Valid, 9765 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 14:19:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-03 14:19:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2669. [2025-03-03 14:19:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2026 states have (on average 1.6332675222112536) internal successors, (3309), 2102 states have internal predecessors, (3309), 516 states have call successors, (516), 109 states have call predecessors, (516), 126 states have return successors, (549), 490 states have call predecessors, (549), 511 states have call successors, (549) [2025-03-03 14:19:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4374 transitions. [2025-03-03 14:19:16,562 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4374 transitions. Word has length 114 [2025-03-03 14:19:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:16,562 INFO L471 AbstractCegarLoop]: Abstraction has 2669 states and 4374 transitions. [2025-03-03 14:19:16,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:19:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4374 transitions. [2025-03-03 14:19:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:19:16,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:16,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:16,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:19:16,566 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:16,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1468615842, now seen corresponding path program 1 times [2025-03-03 14:19:16,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:16,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455345905] [2025-03-03 14:19:16,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:16,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:19:16,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:19:16,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:16,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:16,847 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:19:16,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:16,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455345905] [2025-03-03 14:19:16,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455345905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:16,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:16,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:19:16,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064996836] [2025-03-03 14:19:16,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:16,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:19:16,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:16,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:19:16,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:19:16,849 INFO L87 Difference]: Start difference. First operand 2669 states and 4374 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, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:19:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:18,204 INFO L93 Difference]: Finished difference Result 5321 states and 8868 transitions. [2025-03-03 14:19:18,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:19:18,205 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, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 115 [2025-03-03 14:19:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:18,221 INFO L225 Difference]: With dead ends: 5321 [2025-03-03 14:19:18,221 INFO L226 Difference]: Without dead ends: 2697 [2025-03-03 14:19:18,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:18,234 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1331 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 2820 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 3212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 2820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:18,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1558 Invalid, 3212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 2820 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:19:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-03-03 14:19:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2693. [2025-03-03 14:19:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2044 states have (on average 1.6276908023483365) internal successors, (3327), 2120 states have internal predecessors, (3327), 516 states have call successors, (516), 109 states have call predecessors, (516), 132 states have return successors, (615), 496 states have call predecessors, (615), 511 states have call successors, (615) [2025-03-03 14:19:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4458 transitions. [2025-03-03 14:19:18,367 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4458 transitions. Word has length 115 [2025-03-03 14:19:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:18,368 INFO L471 AbstractCegarLoop]: Abstraction has 2693 states and 4458 transitions. [2025-03-03 14:19:18,368 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, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:19:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4458 transitions. [2025-03-03 14:19:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:19:18,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:18,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:18,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:19:18,372 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:18,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash 555042501, now seen corresponding path program 1 times [2025-03-03 14:19:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577426733] [2025-03-03 14:19:18,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:18,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:18,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:19:18,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:19:18,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:18,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,552 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:19:18,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:18,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577426733] [2025-03-03 14:19:18,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577426733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:18,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:18,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:19:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681591635] [2025-03-03 14:19:18,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:18,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:19:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:18,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:19:18,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:18,554 INFO L87 Difference]: Start difference. First operand 2693 states and 4458 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, (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:19:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:20,804 INFO L93 Difference]: Finished difference Result 8621 states and 14663 transitions. [2025-03-03 14:19:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:19:20,805 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2025-03-03 14:19:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:20,833 INFO L225 Difference]: With dead ends: 8621 [2025-03-03 14:19:20,833 INFO L226 Difference]: Without dead ends: 5973 [2025-03-03 14:19:20,846 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:19:20,846 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 2785 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 4648 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2858 SdHoareTripleChecker+Valid, 2312 SdHoareTripleChecker+Invalid, 5375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 4648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:20,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2858 Valid, 2312 Invalid, 5375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 4648 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 14:19:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2025-03-03 14:19:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 5674. [2025-03-03 14:19:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5674 states, 4278 states have (on average 1.608695652173913) internal successors, (6882), 4459 states have internal predecessors, (6882), 1111 states have call successors, (1111), 252 states have call predecessors, (1111), 284 states have return successors, (1296), 1039 states have call predecessors, (1296), 1106 states have call successors, (1296) [2025-03-03 14:19:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 9289 transitions. [2025-03-03 14:19:21,153 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 9289 transitions. Word has length 116 [2025-03-03 14:19:21,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:21,153 INFO L471 AbstractCegarLoop]: Abstraction has 5674 states and 9289 transitions. [2025-03-03 14:19:21,154 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, (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:19:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 9289 transitions. [2025-03-03 14:19:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:19:21,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:21,158 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:19:21,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:19:21,158 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:21,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:21,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2093708535, now seen corresponding path program 1 times [2025-03-03 14:19:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:21,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142170436] [2025-03-03 14:19:21,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:21,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:21,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:19:21,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:19:21,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:21,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:21,306 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:19:21,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:21,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142170436] [2025-03-03 14:19:21,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142170436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:21,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:21,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:21,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722859367] [2025-03-03 14:19:21,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:21,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:21,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:21,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:21,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:21,308 INFO L87 Difference]: Start difference. First operand 5674 states and 9289 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:19:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:23,485 INFO L93 Difference]: Finished difference Result 16362 states and 27362 transitions. [2025-03-03 14:19:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:19:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 118 [2025-03-03 14:19:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:23,537 INFO L225 Difference]: With dead ends: 16362 [2025-03-03 14:19:23,537 INFO L226 Difference]: Without dead ends: 10729 [2025-03-03 14:19:23,560 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:19:23,561 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 3409 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 3497 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 3497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:23,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 2031 Invalid, 4532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1035 Valid, 3497 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:19:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10729 states. [2025-03-03 14:19:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10729 to 9513. [2025-03-03 14:19:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9513 states, 6873 states have (on average 1.5888258402444349) internal successors, (10920), 7284 states have internal predecessors, (10920), 2183 states have call successors, (2183), 384 states have call predecessors, (2183), 456 states have return successors, (2605), 2117 states have call predecessors, (2605), 2178 states have call successors, (2605) [2025-03-03 14:19:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9513 states to 9513 states and 15708 transitions. [2025-03-03 14:19:24,144 INFO L78 Accepts]: Start accepts. Automaton has 9513 states and 15708 transitions. Word has length 118 [2025-03-03 14:19:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:24,145 INFO L471 AbstractCegarLoop]: Abstraction has 9513 states and 15708 transitions. [2025-03-03 14:19:24,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:19:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 9513 states and 15708 transitions. [2025-03-03 14:19:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:19:24,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:24,148 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:19:24,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:19:24,148 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:24,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash -950193984, now seen corresponding path program 1 times [2025-03-03 14:19:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:24,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168111943] [2025-03-03 14:19:24,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:24,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:19:24,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:19:24,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:24,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:24,290 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:19:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168111943] [2025-03-03 14:19:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168111943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:24,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050849935] [2025-03-03 14:19:24,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:24,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:24,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:24,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:24,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:24,292 INFO L87 Difference]: Start difference. First operand 9513 states and 15708 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:19:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:27,369 INFO L93 Difference]: Finished difference Result 31788 states and 54175 transitions. [2025-03-03 14:19:27,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:19:27,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 119 [2025-03-03 14:19:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:27,477 INFO L225 Difference]: With dead ends: 31788 [2025-03-03 14:19:27,477 INFO L226 Difference]: Without dead ends: 22323 [2025-03-03 14:19:27,513 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:19:27,514 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 3422 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 3462 mSolverCounterSat, 1057 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3456 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 4519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1057 IncrementalHoareTripleChecker+Valid, 3462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:27,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3456 Valid, 2044 Invalid, 4519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1057 Valid, 3462 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 14:19:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22323 states. [2025-03-03 14:19:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22323 to 19972. [2025-03-03 14:19:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19972 states, 13545 states have (on average 1.564857881136951) internal successors, (21196), 14621 states have internal predecessors, (21196), 5556 states have call successors, (5556), 650 states have call predecessors, (5556), 870 states have return successors, (6904), 5568 states have call predecessors, (6904), 5551 states have call successors, (6904) [2025-03-03 14:19:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19972 states to 19972 states and 33656 transitions. [2025-03-03 14:19:28,649 INFO L78 Accepts]: Start accepts. Automaton has 19972 states and 33656 transitions. Word has length 119 [2025-03-03 14:19:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:28,650 INFO L471 AbstractCegarLoop]: Abstraction has 19972 states and 33656 transitions. [2025-03-03 14:19:28,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:19:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 19972 states and 33656 transitions. [2025-03-03 14:19:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:19:28,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:28,653 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:28,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:19:28,654 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:28,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash -115789892, now seen corresponding path program 1 times [2025-03-03 14:19:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:28,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825437565] [2025-03-03 14:19:28,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:28,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:28,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:19:28,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:19:28,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:28,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:28,800 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:19:28,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825437565] [2025-03-03 14:19:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825437565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:28,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:28,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:28,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561830698] [2025-03-03 14:19:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:28,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:28,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:28,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:28,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:28,802 INFO L87 Difference]: Start difference. First operand 19972 states and 33656 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:19:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:34,199 INFO L93 Difference]: Finished difference Result 76998 states and 134671 transitions. [2025-03-03 14:19:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:19:34,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 120 [2025-03-03 14:19:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:34,613 INFO L225 Difference]: With dead ends: 76998 [2025-03-03 14:19:34,614 INFO L226 Difference]: Without dead ends: 57076 [2025-03-03 14:19:34,725 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:19:34,726 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 3434 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 3467 mSolverCounterSat, 1061 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3469 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1061 IncrementalHoareTripleChecker+Valid, 3467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:34,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3469 Valid, 2065 Invalid, 4528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1061 Valid, 3467 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:19:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57076 states. [2025-03-03 14:19:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57076 to 51159. [2025-03-03 14:19:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51159 states, 32439 states have (on average 1.543728228367089) internal successors, (50077), 35572 states have internal predecessors, (50077), 16751 states have call successors, (16751), 1182 states have call predecessors, (16751), 1968 states have return successors, (22005), 17183 states have call predecessors, (22005), 16746 states have call successors, (22005) [2025-03-03 14:19:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51159 states to 51159 states and 88833 transitions. [2025-03-03 14:19:39,163 INFO L78 Accepts]: Start accepts. Automaton has 51159 states and 88833 transitions. Word has length 120 [2025-03-03 14:19:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:39,163 INFO L471 AbstractCegarLoop]: Abstraction has 51159 states and 88833 transitions. [2025-03-03 14:19:39,163 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, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:19:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 51159 states and 88833 transitions. [2025-03-03 14:19:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:19:39,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:39,167 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:39,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:19:39,167 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:39,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash 687034853, now seen corresponding path program 1 times [2025-03-03 14:19:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:39,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027773916] [2025-03-03 14:19:39,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:39,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:39,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:19:39,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:19:39,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:39,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:39,531 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:19:39,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:39,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027773916] [2025-03-03 14:19:39,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027773916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:39,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:39,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:39,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273565314] [2025-03-03 14:19:39,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:39,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:39,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:39,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:39,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:39,533 INFO L87 Difference]: Start difference. First operand 51159 states and 88833 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, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:19:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:53,063 INFO L93 Difference]: Finished difference Result 219826 states and 395668 transitions. [2025-03-03 14:19:53,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:19:53,063 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, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 121 [2025-03-03 14:19:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:54,842 INFO L225 Difference]: With dead ends: 219826 [2025-03-03 14:19:54,847 INFO L226 Difference]: Without dead ends: 168721 [2025-03-03 14:19:55,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:55,132 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 3446 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 1063 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3482 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 4539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1063 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:55,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3482 Valid, 2086 Invalid, 4539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1063 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:19:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168721 states.