./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec3_product18.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 b60f36c6abb85551baa468c8faf905605a37519376312e75fd6944689b1d0b8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:27:17,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:27:17,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:27:17,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:27:17,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:27:17,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:27:17,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:27:17,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:27:17,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:27:17,815 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:27:17,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:27:17,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:27:17,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:27:17,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:27:17,815 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:27:17,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:27:17,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:27:17,815 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:27:17,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:27:17,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:27:17,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:27:17,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:27:17,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:27:17,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:27:17,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:27:17,818 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:27:17,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:27:17,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:27:17,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:27:17,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:27:17,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:27:17,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:27:17,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:27:17,819 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 -> b60f36c6abb85551baa468c8faf905605a37519376312e75fd6944689b1d0b8d [2025-03-08 05:27:18,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:27:18,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:27:18,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:27:18,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:27:18,090 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:27:18,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c [2025-03-08 05:27:19,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63dce10bb/d4f1d2b85a554435a1ab3d5a6694f3ff/FLAGc39ab0962 [2025-03-08 05:27:19,718 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:27:19,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c [2025-03-08 05:27:19,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63dce10bb/d4f1d2b85a554435a1ab3d5a6694f3ff/FLAGc39ab0962 [2025-03-08 05:27:19,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63dce10bb/d4f1d2b85a554435a1ab3d5a6694f3ff [2025-03-08 05:27:19,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:27:19,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:27:19,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:27:19,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:27:19,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:27:19,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:19" (1/1) ... [2025-03-08 05:27:19,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fae74d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:19, skipping insertion in model container [2025-03-08 05:27:19,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:19" (1/1) ... [2025-03-08 05:27:19,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:27:20,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c[32398,32411] [2025-03-08 05:27:20,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:27:20,409 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:27:20,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-08 05:27:20,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [86] [2025-03-08 05:27:20,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [452] [2025-03-08 05:27:20,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1120] [2025-03-08 05:27:20,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1476] [2025-03-08 05:27:20,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1485] [2025-03-08 05:27:20,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2984] [2025-03-08 05:27:20,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [3102] [2025-03-08 05:27:20,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3288] [2025-03-08 05:27:20,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3303] [2025-03-08 05:27:20,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c[32398,32411] [2025-03-08 05:27:20,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:27:20,547 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:27:20,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20 WrapperNode [2025-03-08 05:27:20,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:27:20,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:27:20,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:27:20,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:27:20,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,614 INFO L138 Inliner]: procedures = 90, calls = 344, calls flagged for inlining = 25, calls inlined = 21, statements flattened = 815 [2025-03-08 05:27:20,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:27:20,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:27:20,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:27:20,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:27:20,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,654 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:27:20,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,676 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:27:20,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:27:20,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:27:20,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:27:20,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 05:27:20,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:27:20,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:20,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:27:20,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:27:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:27:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-08 05:27:20,765 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-08 05:27:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:27:20,765 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:27:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:27:20,765 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:27:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:27:20,765 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:27:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-08 05:27:20,766 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-08 05:27:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:27:20,766 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:27:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:27:20,767 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:27:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:27:20,767 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:27:20,768 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:27:20,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:27:20,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:27:20,769 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:27:20,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-08 05:27:20,769 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:27:20,769 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:27:20,769 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-08 05:27:20,769 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:27:20,769 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:27:20,769 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:27:20,769 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:27:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:27:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2025-03-08 05:27:20,771 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2025-03-08 05:27:20,772 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-08 05:27:20,772 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-08 05:27:20,772 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:27:20,772 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:27:20,772 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:27:20,772 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:27:20,772 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:27:20,772 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:27:20,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:27:20,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:27:20,772 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:27:20,772 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:27:20,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:27:20,922 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:27:20,955 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: #res := ~retValue_acc~14; [2025-03-08 05:27:20,993 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3099: #res := ~retValue_acc~25; [2025-03-08 05:27:21,025 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3021: #res := ~retValue_acc~23; [2025-03-08 05:27:21,028 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565: #res := ~retValue_acc~10; [2025-03-08 05:27:21,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: #res := ~retValue_acc~18; [2025-03-08 05:27:21,450 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2359: #res := ~retValue_acc~21; [2025-03-08 05:27:21,468 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: #res := ~retValue_acc~24; [2025-03-08 05:27:21,591 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2345-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-03-08 05:27:21,602 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1761: #res := ~retValue_acc~13; [2025-03-08 05:27:21,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-08 05:27:21,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-08 05:27:21,745 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1718-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~11#1; [2025-03-08 05:27:21,745 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2025-03-08 05:27:21,797 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L806: #res := ~retValue_acc~6; [2025-03-08 05:27:21,860 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-08 05:27:21,860 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1473-1: main_#res#1 := main_~retValue_acc~9#1; [2025-03-08 05:27:21,871 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: #res := ~retValue_acc~5; [2025-03-08 05:27:21,875 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1117: #res := ~retValue_acc~7; [2025-03-08 05:27:22,028 INFO L? ?]: Removed 439 outVars from TransFormulas that were not future-live. [2025-03-08 05:27:22,029 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:27:22,057 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:27:22,057 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:27:22,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:22 BoogieIcfgContainer [2025-03-08 05:27:22,058 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:27:22,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:27:22,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:27:22,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:27:22,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:27:19" (1/3) ... [2025-03-08 05:27:22,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4dda6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:22, skipping insertion in model container [2025-03-08 05:27:22,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (2/3) ... [2025-03-08 05:27:22,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4dda6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:22, skipping insertion in model container [2025-03-08 05:27:22,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:22" (3/3) ... [2025-03-08 05:27:22,066 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product18.cil.c [2025-03-08 05:27:22,079 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:27:22,082 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product18.cil.c that has 26 procedures, 567 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:27:22,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:27:22,156 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;@41c6575d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:27:22,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:27:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 567 states, 438 states have (on average 1.6849315068493151) internal successors, (738), 458 states have internal predecessors, (738), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 05:27:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 05:27:22,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:22,173 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] [2025-03-08 05:27:22,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:22,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:22,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1624083332, now seen corresponding path program 1 times [2025-03-08 05:27:22,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:22,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721119372] [2025-03-08 05:27:22,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:22,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:22,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 05:27:22,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 05:27:22,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:22,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:22,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721119372] [2025-03-08 05:27:22,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721119372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:22,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:22,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641606905] [2025-03-08 05:27:22,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:22,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:22,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:22,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:22,917 INFO L87 Difference]: Start difference. First operand has 567 states, 438 states have (on average 1.6849315068493151) internal successors, (738), 458 states have internal predecessors, (738), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:23,159 INFO L93 Difference]: Finished difference Result 1131 states and 1896 transitions. [2025-03-08 05:27:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:23,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-03-08 05:27:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:23,181 INFO L225 Difference]: With dead ends: 1131 [2025-03-08 05:27:23,182 INFO L226 Difference]: Without dead ends: 572 [2025-03-08 05:27:23,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:23,196 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 91 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5482 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:23,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5482 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:27:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-08 05:27:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 570. [2025-03-08 05:27:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 441 states have (on average 1.6780045351473922) internal successors, (740), 461 states have internal predecessors, (740), 103 states have call successors, (103), 25 states have call predecessors, (103), 25 states have return successors, (102), 97 states have call predecessors, (102), 100 states have call successors, (102) [2025-03-08 05:27:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 945 transitions. [2025-03-08 05:27:23,295 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 945 transitions. Word has length 63 [2025-03-08 05:27:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:23,296 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 945 transitions. [2025-03-08 05:27:23,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 945 transitions. [2025-03-08 05:27:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:27:23,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:23,299 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] [2025-03-08 05:27:23,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:27:23,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:23,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash 906917789, now seen corresponding path program 1 times [2025-03-08 05:27:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559691895] [2025-03-08 05:27:23,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:23,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:27:23,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:27:23,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:23,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:23,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:23,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559691895] [2025-03-08 05:27:23,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559691895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:23,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:23,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:23,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310607200] [2025-03-08 05:27:23,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:23,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:23,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:23,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:23,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:23,493 INFO L87 Difference]: Start difference. First operand 570 states and 945 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:27:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:23,577 INFO L93 Difference]: Finished difference Result 1122 states and 1871 transitions. [2025-03-08 05:27:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:23,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-08 05:27:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:23,583 INFO L225 Difference]: With dead ends: 1122 [2025-03-08 05:27:23,587 INFO L226 Difference]: Without dead ends: 546 [2025-03-08 05:27:23,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:23,593 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 14 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:23,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2740 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-08 05:27:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2025-03-08 05:27:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 420 states have (on average 1.6690476190476191) internal successors, (701), 438 states have internal predecessors, (701), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 05:27:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 902 transitions. [2025-03-08 05:27:23,653 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 902 transitions. Word has length 64 [2025-03-08 05:27:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:23,653 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 902 transitions. [2025-03-08 05:27:23,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:27:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 902 transitions. [2025-03-08 05:27:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:27:23,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:23,658 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] [2025-03-08 05:27:23,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:27:23,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:23,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1495521615, now seen corresponding path program 1 times [2025-03-08 05:27:23,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:23,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554657583] [2025-03-08 05:27:23,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:23,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:23,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:27:23,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:27:23,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:23,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:23,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:23,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554657583] [2025-03-08 05:27:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554657583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:23,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030948818] [2025-03-08 05:27:23,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:23,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:23,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:23,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:23,936 INFO L87 Difference]: Start difference. First operand 546 states and 902 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:24,052 INFO L93 Difference]: Finished difference Result 1085 states and 1803 transitions. [2025-03-08 05:27:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2025-03-08 05:27:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:24,057 INFO L225 Difference]: With dead ends: 1085 [2025-03-08 05:27:24,058 INFO L226 Difference]: Without dead ends: 540 [2025-03-08 05:27:24,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:24,061 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 77 mSDsluCounter, 4385 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5276 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:24,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5276 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-08 05:27:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-03-08 05:27:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 414 states have (on average 1.6618357487922706) internal successors, (688), 432 states have internal predecessors, (688), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 05:27:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 889 transitions. [2025-03-08 05:27:24,089 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 889 transitions. Word has length 64 [2025-03-08 05:27:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:24,090 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 889 transitions. [2025-03-08 05:27:24,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 889 transitions. [2025-03-08 05:27:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:27:24,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:24,092 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] [2025-03-08 05:27:24,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:27:24,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:24,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash 82878014, now seen corresponding path program 1 times [2025-03-08 05:27:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:24,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554737052] [2025-03-08 05:27:24,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:24,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:24,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:27:24,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:27:24,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:24,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:24,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:24,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554737052] [2025-03-08 05:27:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554737052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:24,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:24,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930839551] [2025-03-08 05:27:24,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:24,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:24,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:24,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:24,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:24,312 INFO L87 Difference]: Start difference. First operand 540 states and 889 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:24,406 INFO L93 Difference]: Finished difference Result 1073 states and 1777 transitions. [2025-03-08 05:27:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:24,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-08 05:27:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:24,411 INFO L225 Difference]: With dead ends: 1073 [2025-03-08 05:27:24,411 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:27:24,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:24,414 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 63 mSDsluCounter, 4337 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5216 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:24,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5216 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:27:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-08 05:27:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 408 states have (on average 1.6544117647058822) internal successors, (675), 426 states have internal predecessors, (675), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 05:27:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 876 transitions. [2025-03-08 05:27:24,440 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 876 transitions. Word has length 65 [2025-03-08 05:27:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:24,441 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 876 transitions. [2025-03-08 05:27:24,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 876 transitions. [2025-03-08 05:27:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:27:24,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:24,442 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] [2025-03-08 05:27:24,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:27:24,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:24,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1813368969, now seen corresponding path program 1 times [2025-03-08 05:27:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:24,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158834164] [2025-03-08 05:27:24,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:24,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:27:24,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:27:24,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:24,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158834164] [2025-03-08 05:27:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158834164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216336499] [2025-03-08 05:27:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:24,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:24,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:24,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:24,606 INFO L87 Difference]: Start difference. First operand 534 states and 876 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:24,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:24,688 INFO L93 Difference]: Finished difference Result 1061 states and 1751 transitions. [2025-03-08 05:27:24,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:24,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-08 05:27:24,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:24,696 INFO L225 Difference]: With dead ends: 1061 [2025-03-08 05:27:24,696 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 05:27:24,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:24,700 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 49 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5156 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:24,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5156 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 05:27:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-08 05:27:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 402 states have (on average 1.6467661691542288) internal successors, (662), 420 states have internal predecessors, (662), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 05:27:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 863 transitions. [2025-03-08 05:27:24,728 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 863 transitions. Word has length 66 [2025-03-08 05:27:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:24,728 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 863 transitions. [2025-03-08 05:27:24,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 863 transitions. [2025-03-08 05:27:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:27:24,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:24,729 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] [2025-03-08 05:27:24,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:27:24,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:24,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:24,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1194584895, now seen corresponding path program 1 times [2025-03-08 05:27:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:24,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888449782] [2025-03-08 05:27:24,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:24,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:27:24,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:27:24,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:24,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:24,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888449782] [2025-03-08 05:27:24,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888449782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:24,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:24,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983510476] [2025-03-08 05:27:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:24,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:24,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:24,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:24,868 INFO L87 Difference]: Start difference. First operand 528 states and 863 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:24,926 INFO L93 Difference]: Finished difference Result 1049 states and 1725 transitions. [2025-03-08 05:27:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:24,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-08 05:27:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:24,931 INFO L225 Difference]: With dead ends: 1049 [2025-03-08 05:27:24,931 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 05:27:24,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:24,934 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 24 mSDsluCounter, 4253 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:24,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:24,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 05:27:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-08 05:27:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 402 states have (on average 1.644278606965174) internal successors, (661), 420 states have internal predecessors, (661), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 05:27:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 862 transitions. [2025-03-08 05:27:24,951 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 862 transitions. Word has length 66 [2025-03-08 05:27:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:24,952 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 862 transitions. [2025-03-08 05:27:24,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 862 transitions. [2025-03-08 05:27:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:27:24,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:24,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:24,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:27:24,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:24,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2098183944, now seen corresponding path program 1 times [2025-03-08 05:27:24,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:24,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400559818] [2025-03-08 05:27:24,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:24,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:27:24,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:27:24,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:24,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:25,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:25,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400559818] [2025-03-08 05:27:25,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400559818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:25,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:25,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:25,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374535942] [2025-03-08 05:27:25,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:25,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:25,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:25,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:25,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:25,060 INFO L87 Difference]: Start difference. First operand 528 states and 862 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:27:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:25,105 INFO L93 Difference]: Finished difference Result 1040 states and 1710 transitions. [2025-03-08 05:27:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:25,106 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-08 05:27:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:25,110 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 05:27:25,111 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 05:27:25,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:25,114 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 15 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:25,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2526 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 05:27:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-08 05:27:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 402 states have (on average 1.6417910447761195) internal successors, (660), 420 states have internal predecessors, (660), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 05:27:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 861 transitions. [2025-03-08 05:27:25,135 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 861 transitions. Word has length 67 [2025-03-08 05:27:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:25,135 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 861 transitions. [2025-03-08 05:27:25,135 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:27:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 861 transitions. [2025-03-08 05:27:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:27:25,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:25,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:25,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:27:25,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:25,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1910619151, now seen corresponding path program 1 times [2025-03-08 05:27:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:25,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56012562] [2025-03-08 05:27:25,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:25,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:25,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:27:25,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:27:25,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:25,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56012562] [2025-03-08 05:27:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56012562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:25,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488244716] [2025-03-08 05:27:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:25,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:25,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:25,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:25,217 INFO L87 Difference]: Start difference. First operand 528 states and 861 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:27:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:25,262 INFO L93 Difference]: Finished difference Result 1040 states and 1708 transitions. [2025-03-08 05:27:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:25,263 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-08 05:27:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:25,269 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 05:27:25,269 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 05:27:25,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:25,273 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 14 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2528 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:25,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2528 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 05:27:25,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-08 05:27:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 402 states have (on average 1.6393034825870647) internal successors, (659), 420 states have internal predecessors, (659), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 05:27:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 860 transitions. [2025-03-08 05:27:25,295 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 860 transitions. Word has length 68 [2025-03-08 05:27:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:25,296 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 860 transitions. [2025-03-08 05:27:25,296 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:27:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 860 transitions. [2025-03-08 05:27:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:27:25,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:25,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:25,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:27:25,297 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:25,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:25,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1728769819, now seen corresponding path program 1 times [2025-03-08 05:27:25,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:25,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130859598] [2025-03-08 05:27:25,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:25,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:25,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:27:25,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:27:25,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:25,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:25,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:25,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130859598] [2025-03-08 05:27:25,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130859598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:25,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:25,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:25,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194232887] [2025-03-08 05:27:25,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:25,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:25,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:25,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:25,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:25,392 INFO L87 Difference]: Start difference. First operand 528 states and 860 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:27:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:25,427 INFO L93 Difference]: Finished difference Result 1040 states and 1706 transitions. [2025-03-08 05:27:25,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:25,428 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-08 05:27:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:25,432 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 05:27:25,432 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 05:27:25,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:25,435 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 13 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:25,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2530 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:25,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 05:27:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-08 05:27:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 402 states have (on average 1.63681592039801) internal successors, (658), 420 states have internal predecessors, (658), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 05:27:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 859 transitions. [2025-03-08 05:27:25,453 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 859 transitions. Word has length 69 [2025-03-08 05:27:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:25,453 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 859 transitions. [2025-03-08 05:27:25,454 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:27:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 859 transitions. [2025-03-08 05:27:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:27:25,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:25,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:25,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:27:25,455 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:25,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:25,455 INFO L85 PathProgramCache]: Analyzing trace with hash 705558580, now seen corresponding path program 1 times [2025-03-08 05:27:25,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:25,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191116404] [2025-03-08 05:27:25,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:25,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:25,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:27:25,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:27:25,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:25,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191116404] [2025-03-08 05:27:25,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191116404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:25,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:25,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:25,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502323079] [2025-03-08 05:27:25,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:25,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:25,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:25,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:25,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:25,532 INFO L87 Difference]: Start difference. First operand 528 states and 859 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:27:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:25,570 INFO L93 Difference]: Finished difference Result 1040 states and 1704 transitions. [2025-03-08 05:27:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:25,570 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-08 05:27:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:25,576 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 05:27:25,576 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 05:27:25,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:25,579 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 12 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:25,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2532 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 05:27:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-08 05:27:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 402 states have (on average 1.6343283582089552) internal successors, (657), 420 states have internal predecessors, (657), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 05:27:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 858 transitions. [2025-03-08 05:27:25,596 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 858 transitions. Word has length 70 [2025-03-08 05:27:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:25,596 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 858 transitions. [2025-03-08 05:27:25,597 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:27:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 858 transitions. [2025-03-08 05:27:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:27:25,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:25,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:25,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:27:25,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:25,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1170628926, now seen corresponding path program 1 times [2025-03-08 05:27:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:25,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489266193] [2025-03-08 05:27:25,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:25,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:27:25,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:27:25,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:25,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:27:25,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:25,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489266193] [2025-03-08 05:27:25,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489266193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250557674] [2025-03-08 05:27:25,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:25,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:25,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:25,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:25,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:27:25,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:27:26,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:27:26,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:26,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:26,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:27:26,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:27:26,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:26,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250557674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:26,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:26,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 05:27:26,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28360325] [2025-03-08 05:27:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:26,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:26,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:26,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:26,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:27:26,127 INFO L87 Difference]: Start difference. First operand 528 states and 858 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:26,208 INFO L93 Difference]: Finished difference Result 1496 states and 2464 transitions. [2025-03-08 05:27:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:26,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 71 [2025-03-08 05:27:26,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:26,218 INFO L225 Difference]: With dead ends: 1496 [2025-03-08 05:27:26,218 INFO L226 Difference]: Without dead ends: 986 [2025-03-08 05:27:26,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:27:26,223 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 823 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:26,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1622 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-03-08 05:27:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 971. [2025-03-08 05:27:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 746 states have (on average 1.648793565683646) internal successors, (1230), 781 states have internal predecessors, (1230), 180 states have call successors, (180), 45 states have call predecessors, (180), 44 states have return successors, (182), 172 states have call predecessors, (182), 177 states have call successors, (182) [2025-03-08 05:27:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1592 transitions. [2025-03-08 05:27:26,272 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1592 transitions. Word has length 71 [2025-03-08 05:27:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:26,273 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1592 transitions. [2025-03-08 05:27:26,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1592 transitions. [2025-03-08 05:27:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:27:26,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:26,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:26,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:27:26,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 05:27:26,475 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:26,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2066624109, now seen corresponding path program 1 times [2025-03-08 05:27:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:26,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612950661] [2025-03-08 05:27:26,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:26,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:27:26,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:27:26,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:26,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:27:26,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:26,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612950661] [2025-03-08 05:27:26,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612950661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:26,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677690947] [2025-03-08 05:27:26,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:26,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:26,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:26,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:26,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:27:26,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:27:26,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:27:26,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:26,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:26,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:27:26,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:27:27,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:27,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677690947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:27,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:27,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 05:27:27,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486980469] [2025-03-08 05:27:27,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:27,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:27,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:27,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:27,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:27:27,031 INFO L87 Difference]: Start difference. First operand 971 states and 1592 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:27,114 INFO L93 Difference]: Finished difference Result 2382 states and 3934 transitions. [2025-03-08 05:27:27,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:27,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2025-03-08 05:27:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:27,126 INFO L225 Difference]: With dead ends: 2382 [2025-03-08 05:27:27,127 INFO L226 Difference]: Without dead ends: 1429 [2025-03-08 05:27:27,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:27:27,133 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 822 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:27,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1676 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-03-08 05:27:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1381. [2025-03-08 05:27:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1063 states have (on average 1.6622765757290687) internal successors, (1767), 1115 states have internal predecessors, (1767), 255 states have call successors, (255), 62 states have call predecessors, (255), 62 states have return successors, (262), 245 states have call predecessors, (262), 252 states have call successors, (262) [2025-03-08 05:27:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2284 transitions. [2025-03-08 05:27:27,198 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2284 transitions. Word has length 72 [2025-03-08 05:27:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:27,198 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 2284 transitions. [2025-03-08 05:27:27,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:27:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2284 transitions. [2025-03-08 05:27:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:27:27,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:27,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:27,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:27:27,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:27:27,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:27,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:27,401 INFO L85 PathProgramCache]: Analyzing trace with hash 165809826, now seen corresponding path program 1 times [2025-03-08 05:27:27,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:27,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395791897] [2025-03-08 05:27:27,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:27,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:27,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:27:27,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:27:27,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:27,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:27,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395791897] [2025-03-08 05:27:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395791897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:27,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:27,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818661983] [2025-03-08 05:27:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:27,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:27,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:27,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:27,529 INFO L87 Difference]: Start difference. First operand 1381 states and 2284 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:28,060 INFO L93 Difference]: Finished difference Result 4079 states and 6877 transitions. [2025-03-08 05:27:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:28,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2025-03-08 05:27:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:28,084 INFO L225 Difference]: With dead ends: 4079 [2025-03-08 05:27:28,085 INFO L226 Difference]: Without dead ends: 2716 [2025-03-08 05:27:28,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:28,094 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 847 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 4549 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:28,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 4549 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:27:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2025-03-08 05:27:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2669. [2025-03-08 05:27:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2059 states have (on average 1.6663428848955804) internal successors, (3431), 2159 states have internal predecessors, (3431), 489 states have call successors, (489), 118 states have call predecessors, (489), 120 states have return successors, (577), 475 states have call predecessors, (577), 485 states have call successors, (577) [2025-03-08 05:27:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4497 transitions. [2025-03-08 05:27:28,223 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4497 transitions. Word has length 74 [2025-03-08 05:27:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:28,224 INFO L471 AbstractCegarLoop]: Abstraction has 2669 states and 4497 transitions. [2025-03-08 05:27:28,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:27:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4497 transitions. [2025-03-08 05:27:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 05:27:28,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:28,225 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:28,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:27:28,226 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:28,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash -921358116, now seen corresponding path program 1 times [2025-03-08 05:27:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:28,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86044749] [2025-03-08 05:27:28,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:28,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:27:28,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:27:28,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:28,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:27:28,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:28,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86044749] [2025-03-08 05:27:28,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86044749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:28,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522744864] [2025-03-08 05:27:28,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:28,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:28,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:28,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:28,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:27:28,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:27:28,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:27:28,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:28,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:28,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:27:28,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:27:28,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:28,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522744864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:28,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:28,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-08 05:27:28,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730705708] [2025-03-08 05:27:28,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:28,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:27:28,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:28,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:27:28,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:27:28,814 INFO L87 Difference]: Start difference. First operand 2669 states and 4497 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:27:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:29,273 INFO L93 Difference]: Finished difference Result 7198 states and 12330 transitions. [2025-03-08 05:27:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:27:29,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2025-03-08 05:27:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:29,312 INFO L225 Difference]: With dead ends: 7198 [2025-03-08 05:27:29,312 INFO L226 Difference]: Without dead ends: 4547 [2025-03-08 05:27:29,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:27:29,330 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 724 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:29,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 3213 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:27:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4547 states. [2025-03-08 05:27:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4547 to 4504. [2025-03-08 05:27:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4504 states, 3472 states have (on average 1.618663594470046) internal successors, (5620), 3638 states have internal predecessors, (5620), 814 states have call successors, (814), 210 states have call predecessors, (814), 217 states have return successors, (1070), 795 states have call predecessors, (1070), 808 states have call successors, (1070) [2025-03-08 05:27:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 7504 transitions. [2025-03-08 05:27:29,554 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 7504 transitions. Word has length 75 [2025-03-08 05:27:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:29,554 INFO L471 AbstractCegarLoop]: Abstraction has 4504 states and 7504 transitions. [2025-03-08 05:27:29,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:27:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 7504 transitions. [2025-03-08 05:27:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 05:27:29,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:29,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:29,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:27:29,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:29,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:29,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1233219063, now seen corresponding path program 1 times [2025-03-08 05:27:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:29,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654944963] [2025-03-08 05:27:29,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:29,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:27:29,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:27:29,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:29,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:27:29,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:29,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654944963] [2025-03-08 05:27:29,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654944963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:29,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:29,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:29,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284294094] [2025-03-08 05:27:29,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:29,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:29,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:29,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:29,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:29,880 INFO L87 Difference]: Start difference. First operand 4504 states and 7504 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:30,159 INFO L93 Difference]: Finished difference Result 9014 states and 15173 transitions. [2025-03-08 05:27:30,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:30,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2025-03-08 05:27:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:30,204 INFO L225 Difference]: With dead ends: 9014 [2025-03-08 05:27:30,204 INFO L226 Difference]: Without dead ends: 4528 [2025-03-08 05:27:30,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:30,237 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 12 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:30,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2498 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:27:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4528 states. [2025-03-08 05:27:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4528 to 4512. [2025-03-08 05:27:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 3478 states have (on average 1.6170212765957446) internal successors, (5624), 3644 states have internal predecessors, (5624), 814 states have call successors, (814), 214 states have call predecessors, (814), 219 states have return successors, (1057), 793 states have call predecessors, (1057), 808 states have call successors, (1057) [2025-03-08 05:27:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 7495 transitions. [2025-03-08 05:27:30,449 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 7495 transitions. Word has length 75 [2025-03-08 05:27:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:30,449 INFO L471 AbstractCegarLoop]: Abstraction has 4512 states and 7495 transitions. [2025-03-08 05:27:30,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:27:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 7495 transitions. [2025-03-08 05:27:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:27:30,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:30,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:30,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:27:30,455 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:30,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:30,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1880385796, now seen corresponding path program 1 times [2025-03-08 05:27:30,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:30,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114919528] [2025-03-08 05:27:30,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:30,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:30,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:27:30,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:27:30,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:30,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:27:30,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:30,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114919528] [2025-03-08 05:27:30,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114919528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:30,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:30,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:30,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891101610] [2025-03-08 05:27:30,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:30,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:30,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:30,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:30,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:30,612 INFO L87 Difference]: Start difference. First operand 4512 states and 7495 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:27:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:31,285 INFO L93 Difference]: Finished difference Result 13487 states and 23213 transitions. [2025-03-08 05:27:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:31,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2025-03-08 05:27:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:31,356 INFO L225 Difference]: With dead ends: 13487 [2025-03-08 05:27:31,356 INFO L226 Difference]: Without dead ends: 8993 [2025-03-08 05:27:31,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:31,376 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 845 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:31,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 4289 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:27:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2025-03-08 05:27:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 8924. [2025-03-08 05:27:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8924 states, 6886 states have (on average 1.6147255300609933) internal successors, (11119), 7212 states have internal predecessors, (11119), 1600 states have call successors, (1600), 422 states have call predecessors, (1600), 437 states have return successors, (2521), 1569 states have call predecessors, (2521), 1590 states have call successors, (2521) [2025-03-08 05:27:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8924 states to 8924 states and 15240 transitions. [2025-03-08 05:27:31,752 INFO L78 Accepts]: Start accepts. Automaton has 8924 states and 15240 transitions. Word has length 83 [2025-03-08 05:27:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:31,753 INFO L471 AbstractCegarLoop]: Abstraction has 8924 states and 15240 transitions. [2025-03-08 05:27:31,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:27:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 8924 states and 15240 transitions. [2025-03-08 05:27:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:27:31,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:31,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:31,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:27:31,754 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:31,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -919119132, now seen corresponding path program 1 times [2025-03-08 05:27:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:31,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619388694] [2025-03-08 05:27:31,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:31,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:27:31,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:27:31,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:31,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:27:31,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:31,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619388694] [2025-03-08 05:27:31,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619388694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:31,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:31,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:31,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588781216] [2025-03-08 05:27:31,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:31,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:31,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:31,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:31,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:31,824 INFO L87 Difference]: Start difference. First operand 8924 states and 15240 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:27:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:32,289 INFO L93 Difference]: Finished difference Result 17902 states and 31033 transitions. [2025-03-08 05:27:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:32,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-08 05:27:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:32,370 INFO L225 Difference]: With dead ends: 17902 [2025-03-08 05:27:32,370 INFO L226 Difference]: Without dead ends: 8996 [2025-03-08 05:27:32,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:32,429 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 12 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:32,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2492 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:27:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8996 states. [2025-03-08 05:27:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8996 to 8964. [2025-03-08 05:27:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8964 states, 6922 states have (on average 1.612106327650968) internal successors, (11159), 7240 states have internal predecessors, (11159), 1600 states have call successors, (1600), 438 states have call predecessors, (1600), 441 states have return successors, (2501), 1565 states have call predecessors, (2501), 1590 states have call successors, (2501) [2025-03-08 05:27:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 15260 transitions. [2025-03-08 05:27:32,919 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 15260 transitions. Word has length 84 [2025-03-08 05:27:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:32,920 INFO L471 AbstractCegarLoop]: Abstraction has 8964 states and 15260 transitions. [2025-03-08 05:27:32,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:27:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 15260 transitions. [2025-03-08 05:27:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:27:32,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:32,922 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:32,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:27:32,922 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:32,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1446245412, now seen corresponding path program 1 times [2025-03-08 05:27:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:32,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707808321] [2025-03-08 05:27:32,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:32,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:27:32,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:27:32,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:32,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:27:33,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:33,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707808321] [2025-03-08 05:27:33,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707808321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:33,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:33,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358114886] [2025-03-08 05:27:33,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:33,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:33,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:33,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:33,049 INFO L87 Difference]: Start difference. First operand 8964 states and 15260 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:27:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:33,957 INFO L93 Difference]: Finished difference Result 26915 states and 48273 transitions. [2025-03-08 05:27:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:33,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-03-08 05:27:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:34,085 INFO L225 Difference]: With dead ends: 26915 [2025-03-08 05:27:34,086 INFO L226 Difference]: Without dead ends: 17969 [2025-03-08 05:27:34,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:34,129 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 839 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 4301 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:34,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 4301 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:27:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17969 states. [2025-03-08 05:27:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17969 to 17868. [2025-03-08 05:27:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17868 states, 13804 states have (on average 1.60917125470878) internal successors, (22213), 14434 states have internal predecessors, (22213), 3178 states have call successors, (3178), 870 states have call predecessors, (3178), 885 states have return successors, (6322), 3123 states have call predecessors, (6322), 3160 states have call successors, (6322) [2025-03-08 05:27:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17868 states to 17868 states and 31713 transitions. [2025-03-08 05:27:34,826 INFO L78 Accepts]: Start accepts. Automaton has 17868 states and 31713 transitions. Word has length 93 [2025-03-08 05:27:34,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:34,828 INFO L471 AbstractCegarLoop]: Abstraction has 17868 states and 31713 transitions. [2025-03-08 05:27:34,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:27:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17868 states and 31713 transitions. [2025-03-08 05:27:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:27:34,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:34,830 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:34,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:27:34,830 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:34,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash 277417155, now seen corresponding path program 1 times [2025-03-08 05:27:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:34,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162609795] [2025-03-08 05:27:34,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:34,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:27:34,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:27:34,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:34,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:27:34,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:34,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162609795] [2025-03-08 05:27:34,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162609795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:34,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:34,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:34,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26126502] [2025-03-08 05:27:34,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:34,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:34,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:34,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:34,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:34,900 INFO L87 Difference]: Start difference. First operand 17868 states and 31713 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:27:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:35,861 INFO L93 Difference]: Finished difference Result 35862 states and 65170 transitions. [2025-03-08 05:27:35,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:35,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2025-03-08 05:27:35,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:36,034 INFO L225 Difference]: With dead ends: 35862 [2025-03-08 05:27:36,034 INFO L226 Difference]: Without dead ends: 18012 [2025-03-08 05:27:36,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:36,160 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 11 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:36,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2495 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:27:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18012 states. [2025-03-08 05:27:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18012 to 17948. [2025-03-08 05:27:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17948 states, 13876 states have (on average 1.6065869126549437) internal successors, (22293), 14506 states have internal predecessors, (22293), 3178 states have call successors, (3178), 886 states have call predecessors, (3178), 893 states have return successors, (6294), 3115 states have call predecessors, (6294), 3160 states have call successors, (6294) [2025-03-08 05:27:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17948 states to 17948 states and 31765 transitions. [2025-03-08 05:27:36,979 INFO L78 Accepts]: Start accepts. Automaton has 17948 states and 31765 transitions. Word has length 94 [2025-03-08 05:27:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:36,979 INFO L471 AbstractCegarLoop]: Abstraction has 17948 states and 31765 transitions. [2025-03-08 05:27:36,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:27:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 17948 states and 31765 transitions. [2025-03-08 05:27:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:27:36,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:36,981 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:36,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:27:36,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:36,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash 911124376, now seen corresponding path program 1 times [2025-03-08 05:27:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:36,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537181371] [2025-03-08 05:27:36,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:36,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:27:37,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:27:37,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:37,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 05:27:37,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:37,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537181371] [2025-03-08 05:27:37,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537181371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:37,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152738725] [2025-03-08 05:27:37,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:37,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:37,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:37,186 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:37,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:27:37,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:27:37,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:27:37,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:37,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:37,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 1836 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:27:37,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:27:37,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:37,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152738725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:37,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:37,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-08 05:27:37,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132089546] [2025-03-08 05:27:37,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:37,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:27:37,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:37,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:27:37,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:27:37,648 INFO L87 Difference]: Start difference. First operand 17948 states and 31765 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 05:27:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:42,295 INFO L93 Difference]: Finished difference Result 64109 states and 120781 transitions. [2025-03-08 05:27:42,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:27:42,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 128 [2025-03-08 05:27:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:42,730 INFO L225 Difference]: With dead ends: 64109 [2025-03-08 05:27:42,730 INFO L226 Difference]: Without dead ends: 46179 [2025-03-08 05:27:42,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:27:42,852 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 2400 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 6353 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 2535 SdHoareTripleChecker+Invalid, 6840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 6353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:42,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2567 Valid, 2535 Invalid, 6840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 6353 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 05:27:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46179 states. [2025-03-08 05:27:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46179 to 45542. [2025-03-08 05:27:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45542 states, 35236 states have (on average 1.6000397320921784) internal successors, (56379), 36762 states have internal predecessors, (56379), 7956 states have call successors, (7956), 2206 states have call predecessors, (7956), 2349 states have return successors, (19445), 7941 states have call predecessors, (19445), 7922 states have call successors, (19445) [2025-03-08 05:27:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45542 states to 45542 states and 83780 transitions. [2025-03-08 05:27:45,112 INFO L78 Accepts]: Start accepts. Automaton has 45542 states and 83780 transitions. Word has length 128 [2025-03-08 05:27:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:45,112 INFO L471 AbstractCegarLoop]: Abstraction has 45542 states and 83780 transitions. [2025-03-08 05:27:45,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 05:27:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 45542 states and 83780 transitions. [2025-03-08 05:27:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:27:45,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:45,114 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:45,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:27:45,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:45,316 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:45,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2077290759, now seen corresponding path program 1 times [2025-03-08 05:27:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890374033] [2025-03-08 05:27:45,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:45,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:27:45,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:27:45,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:45,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:27:45,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:45,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890374033] [2025-03-08 05:27:45,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890374033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:45,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:45,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390755307] [2025-03-08 05:27:45,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:45,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:45,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:45,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:45,464 INFO L87 Difference]: Start difference. First operand 45542 states and 83780 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:27:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:49,520 INFO L93 Difference]: Finished difference Result 137055 states and 278125 transitions. [2025-03-08 05:27:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:49,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2025-03-08 05:27:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:50,576 INFO L225 Difference]: With dead ends: 137055 [2025-03-08 05:27:50,577 INFO L226 Difference]: Without dead ends: 91531 [2025-03-08 05:27:50,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:50,865 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 837 mSDsluCounter, 3358 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:50,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 4275 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:27:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91531 states. [2025-03-08 05:27:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91531 to 91174. [2025-03-08 05:27:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91174 states, 70552 states have (on average 1.5971623766866991) internal successors, (112683), 73590 states have internal predecessors, (112683), 15880 states have call successors, (15880), 4406 states have call predecessors, (15880), 4741 states have return successors, (52120), 15913 states have call predecessors, (52120), 15814 states have call successors, (52120) [2025-03-08 05:27:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91174 states to 91174 states and 180683 transitions. [2025-03-08 05:27:55,666 INFO L78 Accepts]: Start accepts. Automaton has 91174 states and 180683 transitions. Word has length 104 [2025-03-08 05:27:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:55,666 INFO L471 AbstractCegarLoop]: Abstraction has 91174 states and 180683 transitions. [2025-03-08 05:27:55,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:27:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 91174 states and 180683 transitions. [2025-03-08 05:27:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:27:55,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:55,667 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:55,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:27:55,668 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:55,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash -427837803, now seen corresponding path program 1 times [2025-03-08 05:27:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:55,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841698666] [2025-03-08 05:27:55,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:55,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:27:55,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:27:55,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:55,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:27:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841698666] [2025-03-08 05:27:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841698666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:55,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:55,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:55,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915717126] [2025-03-08 05:27:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:55,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:55,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:55,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:55,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:55,761 INFO L87 Difference]: Start difference. First operand 91174 states and 180683 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:01,589 INFO L93 Difference]: Finished difference Result 183226 states and 380689 transitions. [2025-03-08 05:28:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:01,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2025-03-08 05:28:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:02,455 INFO L225 Difference]: With dead ends: 183226 [2025-03-08 05:28:02,456 INFO L226 Difference]: Without dead ends: 92070 [2025-03-08 05:28:03,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:03,513 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 10 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:03,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2492 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92070 states. [2025-03-08 05:28:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92070 to 91750. [2025-03-08 05:28:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91750 states, 71080 states have (on average 1.5934018007878448) internal successors, (113259), 74118 states have internal predecessors, (113259), 15880 states have call successors, (15880), 4502 states have call predecessors, (15880), 4789 states have return successors, (52056), 15865 states have call predecessors, (52056), 15814 states have call successors, (52056) [2025-03-08 05:28:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91750 states to 91750 states and 181195 transitions. [2025-03-08 05:28:08,428 INFO L78 Accepts]: Start accepts. Automaton has 91750 states and 181195 transitions. Word has length 105 [2025-03-08 05:28:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:08,428 INFO L471 AbstractCegarLoop]: Abstraction has 91750 states and 181195 transitions. [2025-03-08 05:28:08,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 91750 states and 181195 transitions. [2025-03-08 05:28:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:28:08,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:08,430 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:08,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:28:08,430 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:08,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:08,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1556450191, now seen corresponding path program 1 times [2025-03-08 05:28:08,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:08,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923179436] [2025-03-08 05:28:08,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:08,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:08,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:28:08,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:28:08,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:08,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 05:28:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923179436] [2025-03-08 05:28:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923179436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:08,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:08,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:28:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292035360] [2025-03-08 05:28:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:08,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:28:08,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:08,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:28:08,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:08,842 INFO L87 Difference]: Start difference. First operand 91750 states and 181195 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)