./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67b10dcf95f436cfd8f02a55d7d1d272656f1382a4eb6ab4ad3bba992e95e024 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:17:16,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:17:16,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:17:16,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:17:16,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:17:16,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:17:16,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:17:16,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:17:16,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:17:16,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:17:16,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:17:16,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:17:16,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:17:16,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:17:16,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:17:16,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:17:16,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:17:16,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:17:16,167 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 -> 67b10dcf95f436cfd8f02a55d7d1d272656f1382a4eb6ab4ad3bba992e95e024 [2025-03-03 14:17:16,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:17:16,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:17:16,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:17:16,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:17:16,423 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:17:16,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c [2025-03-03 14:17:17,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb74fd62/5d1cdabf091a476085e97e9d300ff104/FLAGc872f9d69 [2025-03-03 14:17:17,915 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:17:17,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c [2025-03-03 14:17:17,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb74fd62/5d1cdabf091a476085e97e9d300ff104/FLAGc872f9d69 [2025-03-03 14:17:18,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb74fd62/5d1cdabf091a476085e97e9d300ff104 [2025-03-03 14:17:18,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:17:18,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:17:18,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:17:18,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:17:18,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:17:18,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ff7ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18, skipping insertion in model container [2025-03-03 14:17:18,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:17:18,438 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_product09.cil.c[21710,21723] [2025-03-03 14:17:18,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:17:18,650 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:17:18,657 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-03-03 14:17:18,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [147] [2025-03-03 14:17:18,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [165] [2025-03-03 14:17:18,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [832] [2025-03-03 14:17:18,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [952] [2025-03-03 14:17:18,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [961] [2025-03-03 14:17:18,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2404] [2025-03-03 14:17:18,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2442] [2025-03-03 14:17:18,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2790] [2025-03-03 14:17:18,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2976] [2025-03-03 14:17:18,685 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_product09.cil.c[21710,21723] [2025-03-03 14:17:18,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:17:18,778 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:17:18,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18 WrapperNode [2025-03-03 14:17:18,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:17:18,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:17:18,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:17:18,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:17:18,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,836 INFO L138 Inliner]: procedures = 87, calls = 336, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 804 [2025-03-03 14:17:18,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:17:18,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:17:18,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:17:18,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:17:18,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,882 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:17:18,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:17:18,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:17:18,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:17:18,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:17:18,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (1/1) ... [2025-03-03 14:17:18,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:17:18,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:18,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:17:18,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:17:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:17:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-03 14:17:18,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-03 14:17:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:17:18,961 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:17:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:17:18,961 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:17:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-03 14:17:18,961 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-03 14:17:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:17:18,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:17:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:17:18,962 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:17:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:17:18,962 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:17:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:17:18,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:17:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:17:18,962 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:17:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:17:18,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:17:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:17:18,963 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:17:18,963 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-03 14:17:18,963 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-03 14:17:18,963 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:17:18,963 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:17:18,963 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-03 14:17:18,963 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-03 14:17:18,963 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:17:18,963 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:17:18,963 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:17:18,963 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:17:18,963 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:17:18,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:17:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:17:18,965 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:17:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:17:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:17:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:17:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:17:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:17:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:17:18,966 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:17:18,966 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:17:18,966 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:17:18,966 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:17:18,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:17:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:17:18,966 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:17:19,142 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:17:19,144 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:17:19,171 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237: #res := ~retValue_acc~10; [2025-03-03 14:17:19,201 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L949: #res := ~retValue_acc~5; [2025-03-03 14:17:19,205 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036: #res := ~retValue_acc~6; [2025-03-03 14:17:19,509 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1722: #res := ~retValue_acc~14; [2025-03-03 14:17:19,572 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: #res := ~retValue_acc~17; [2025-03-03 14:17:19,585 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L910: #res := ~retValue_acc~4; [2025-03-03 14:17:19,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1228: #res := ~retValue_acc~9; [2025-03-03 14:17:19,643 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1277-1: isEmpty_#res#1 := isEmpty_~retValue_acc~11#1; [2025-03-03 14:17:19,705 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1357-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~12#1; [2025-03-03 14:17:19,705 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1370-1: isIdle_#res#1 := isIdle_~retValue_acc~13#1; [2025-03-03 14:17:19,887 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~16#1; [2025-03-03 14:17:19,887 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1185-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~7#1; [2025-03-03 14:17:19,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: #res := ~retValue_acc~1; [2025-03-03 14:17:20,006 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2439-1: valid_product_#res#1 := valid_product_~retValue_acc~20#1; [2025-03-03 14:17:20,006 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2787-1: main_#res#1 := main_~retValue_acc~22#1; [2025-03-03 14:17:20,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: #res := ~retValue_acc~0; [2025-03-03 14:17:20,022 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L829: #res := ~retValue_acc~2; [2025-03-03 14:17:20,128 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2025-03-03 14:17:20,128 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:17:20,155 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:17:20,156 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:17:20,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:17:20 BoogieIcfgContainer [2025-03-03 14:17:20,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:17:20,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:17:20,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:17:20,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:17:20,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:17:18" (1/3) ... [2025-03-03 14:17:20,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5007ebc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:17:20, skipping insertion in model container [2025-03-03 14:17:20,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:18" (2/3) ... [2025-03-03 14:17:20,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5007ebc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:17:20, skipping insertion in model container [2025-03-03 14:17:20,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:17:20" (3/3) ... [2025-03-03 14:17:20,167 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product09.cil.c [2025-03-03 14:17:20,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:17:20,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product09.cil.c that has 24 procedures, 554 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:17:20,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:17:20,245 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;@630f2584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:17:20,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:17:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 554 states, 431 states have (on average 1.6937354988399071) internal successors, (730), 449 states have internal predecessors, (730), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:17:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 14:17:20,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:20,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1950324591, now seen corresponding path program 1 times [2025-03-03 14:17:20,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204224780] [2025-03-03 14:17:20,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:20,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:20,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 14:17:20,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 14:17:20,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:20,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:20,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204224780] [2025-03-03 14:17:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204224780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:20,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:20,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716409568] [2025-03-03 14:17:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:20,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:20,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:20,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:20,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:20,935 INFO L87 Difference]: Start difference. First operand has 554 states, 431 states have (on average 1.6937354988399071) internal successors, (730), 449 states have internal predecessors, (730), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:21,145 INFO L93 Difference]: Finished difference Result 1105 states and 1864 transitions. [2025-03-03 14:17:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:21,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 85 [2025-03-03 14:17:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:21,162 INFO L225 Difference]: With dead ends: 1105 [2025-03-03 14:17:21,162 INFO L226 Difference]: Without dead ends: 559 [2025-03-03 14:17:21,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:21,175 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 91 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5386 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-03 14:17:21,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5386 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-03 14:17:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 557. [2025-03-03 14:17:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 434 states have (on average 1.6866359447004609) internal successors, (732), 452 states have internal predecessors, (732), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (98), 94 states have call predecessors, (98), 96 states have call successors, (98) [2025-03-03 14:17:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 929 transitions. [2025-03-03 14:17:21,276 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 929 transitions. Word has length 85 [2025-03-03 14:17:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:21,276 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 929 transitions. [2025-03-03 14:17:21,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 929 transitions. [2025-03-03 14:17:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:17:21,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:21,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:21,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:17:21,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:21,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -621293629, now seen corresponding path program 1 times [2025-03-03 14:17:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024480392] [2025-03-03 14:17:21,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:21,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:17:21,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:17:21,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:21,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:21,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:21,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024480392] [2025-03-03 14:17:21,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024480392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:21,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:21,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:21,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111140467] [2025-03-03 14:17:21,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:21,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:21,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:21,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:21,449 INFO L87 Difference]: Start difference. First operand 557 states and 929 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:21,527 INFO L93 Difference]: Finished difference Result 1096 states and 1839 transitions. [2025-03-03 14:17:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:21,527 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-03-03 14:17:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:21,533 INFO L225 Difference]: With dead ends: 1096 [2025-03-03 14:17:21,533 INFO L226 Difference]: Without dead ends: 533 [2025-03-03 14:17:21,537 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-03 14:17:21,538 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 14 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2692 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-03 14:17:21,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2692 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-03 14:17:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-03-03 14:17:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 413 states have (on average 1.6779661016949152) internal successors, (693), 429 states have internal predecessors, (693), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 886 transitions. [2025-03-03 14:17:21,565 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 886 transitions. Word has length 86 [2025-03-03 14:17:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:21,565 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 886 transitions. [2025-03-03 14:17:21,565 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 886 transitions. [2025-03-03 14:17:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:17:21,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:21,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:21,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:17:21,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:21,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash -605896801, now seen corresponding path program 1 times [2025-03-03 14:17:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:21,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133504131] [2025-03-03 14:17:21,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:21,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:17:21,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:17:21,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:21,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:21,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:21,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133504131] [2025-03-03 14:17:21,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133504131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:21,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:21,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439060031] [2025-03-03 14:17:21,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:21,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:21,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:21,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:21,814 INFO L87 Difference]: Start difference. First operand 533 states and 886 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:21,908 INFO L93 Difference]: Finished difference Result 1059 states and 1771 transitions. [2025-03-03 14:17:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:21,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2025-03-03 14:17:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:21,915 INFO L225 Difference]: With dead ends: 1059 [2025-03-03 14:17:21,915 INFO L226 Difference]: Without dead ends: 527 [2025-03-03 14:17:21,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:21,919 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 77 mSDsluCounter, 4305 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5180 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-03 14:17:21,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5180 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-03 14:17:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-03-03 14:17:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 407 states have (on average 1.6707616707616708) internal successors, (680), 423 states have internal predecessors, (680), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 873 transitions. [2025-03-03 14:17:21,945 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 873 transitions. Word has length 86 [2025-03-03 14:17:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:21,945 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 873 transitions. [2025-03-03 14:17:21,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 873 transitions. [2025-03-03 14:17:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:17:21,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:21,950 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:21,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:17:21,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:21,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash 73122859, now seen corresponding path program 1 times [2025-03-03 14:17:21,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:21,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179078527] [2025-03-03 14:17:21,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:21,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:21,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:17:21,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:17:21,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:21,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:22,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:22,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179078527] [2025-03-03 14:17:22,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179078527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:22,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:22,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:22,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468509547] [2025-03-03 14:17:22,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:22,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:22,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:22,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:22,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:22,149 INFO L87 Difference]: Start difference. First operand 527 states and 873 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:22,231 INFO L93 Difference]: Finished difference Result 1047 states and 1745 transitions. [2025-03-03 14:17:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:22,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-03-03 14:17:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:22,235 INFO L225 Difference]: With dead ends: 1047 [2025-03-03 14:17:22,236 INFO L226 Difference]: Without dead ends: 521 [2025-03-03 14:17:22,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:22,239 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 63 mSDsluCounter, 4257 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5120 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-03 14:17:22,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5120 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-03 14:17:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-03-03 14:17:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 401 states have (on average 1.6633416458852868) internal successors, (667), 417 states have internal predecessors, (667), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 860 transitions. [2025-03-03 14:17:22,266 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 860 transitions. Word has length 87 [2025-03-03 14:17:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:22,266 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 860 transitions. [2025-03-03 14:17:22,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 860 transitions. [2025-03-03 14:17:22,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:17:22,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:22,268 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:22,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:17:22,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:22,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash 119051569, now seen corresponding path program 1 times [2025-03-03 14:17:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711300977] [2025-03-03 14:17:22,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:22,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:22,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:17:22,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:17:22,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:22,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:22,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:22,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711300977] [2025-03-03 14:17:22,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711300977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:22,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:22,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:22,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804140095] [2025-03-03 14:17:22,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:22,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:22,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:22,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:22,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:22,438 INFO L87 Difference]: Start difference. First operand 521 states and 860 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:22,529 INFO L93 Difference]: Finished difference Result 1035 states and 1719 transitions. [2025-03-03 14:17:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:22,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2025-03-03 14:17:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:22,533 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 14:17:22,533 INFO L226 Difference]: Without dead ends: 515 [2025-03-03 14:17:22,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:22,536 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 49 mSDsluCounter, 4209 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5060 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:22,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5060 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-03 14:17:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-03 14:17:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 395 states have (on average 1.6531645569620252) internal successors, (653), 411 states have internal predecessors, (653), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 846 transitions. [2025-03-03 14:17:22,565 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 846 transitions. Word has length 88 [2025-03-03 14:17:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:22,566 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 846 transitions. [2025-03-03 14:17:22,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 846 transitions. [2025-03-03 14:17:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:17:22,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:22,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:22,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:17:22,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:22,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:22,569 INFO L85 PathProgramCache]: Analyzing trace with hash -676522043, now seen corresponding path program 1 times [2025-03-03 14:17:22,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:22,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836450029] [2025-03-03 14:17:22,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:22,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:22,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:17:22,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:17:22,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:22,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:22,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836450029] [2025-03-03 14:17:22,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836450029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:22,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:22,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:22,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121433593] [2025-03-03 14:17:22,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:22,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:22,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:22,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:22,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:22,683 INFO L87 Difference]: Start difference. First operand 515 states and 846 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-03 14:17:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:22,738 INFO L93 Difference]: Finished difference Result 1014 states and 1678 transitions. [2025-03-03 14:17:22,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:22,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 89 [2025-03-03 14:17:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:22,742 INFO L225 Difference]: With dead ends: 1014 [2025-03-03 14:17:22,742 INFO L226 Difference]: Without dead ends: 515 [2025-03-03 14:17:22,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:22,747 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 15 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2478 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-03 14:17:22,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2478 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-03 14:17:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-03 14:17:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 395 states have (on average 1.650632911392405) internal successors, (652), 411 states have internal predecessors, (652), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 845 transitions. [2025-03-03 14:17:22,769 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 845 transitions. Word has length 89 [2025-03-03 14:17:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:22,770 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 845 transitions. [2025-03-03 14:17:22,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-03 14:17:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 845 transitions. [2025-03-03 14:17:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 14:17:22,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:22,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:22,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:17:22,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:22,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2054720511, now seen corresponding path program 1 times [2025-03-03 14:17:22,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:22,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848610936] [2025-03-03 14:17:22,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:22,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:22,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:17:22,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:17:22,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:22,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848610936] [2025-03-03 14:17:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848610936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960430311] [2025-03-03 14:17:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:22,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:22,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:22,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:22,883 INFO L87 Difference]: Start difference. First operand 515 states and 845 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-03 14:17:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:22,923 INFO L93 Difference]: Finished difference Result 1014 states and 1676 transitions. [2025-03-03 14:17:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:22,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 90 [2025-03-03 14:17:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:22,927 INFO L225 Difference]: With dead ends: 1014 [2025-03-03 14:17:22,930 INFO L226 Difference]: Without dead ends: 515 [2025-03-03 14:17:22,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:22,933 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 14 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2480 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-03 14:17:22,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2480 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-03 14:17:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-03 14:17:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 395 states have (on average 1.6481012658227847) internal successors, (651), 411 states have internal predecessors, (651), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 844 transitions. [2025-03-03 14:17:22,951 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 844 transitions. Word has length 90 [2025-03-03 14:17:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:22,952 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 844 transitions. [2025-03-03 14:17:22,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-03 14:17:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 844 transitions. [2025-03-03 14:17:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:17:22,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:22,954 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:22,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:17:22,954 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:22,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:22,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1632470520, now seen corresponding path program 1 times [2025-03-03 14:17:22,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:22,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577958239] [2025-03-03 14:17:22,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:22,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:22,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:17:22,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:17:22,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:22,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:23,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:23,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577958239] [2025-03-03 14:17:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577958239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:23,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:23,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488893004] [2025-03-03 14:17:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:23,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:23,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:23,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:23,054 INFO L87 Difference]: Start difference. First operand 515 states and 844 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-03 14:17:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:23,089 INFO L93 Difference]: Finished difference Result 1014 states and 1674 transitions. [2025-03-03 14:17:23,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 91 [2025-03-03 14:17:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:23,093 INFO L225 Difference]: With dead ends: 1014 [2025-03-03 14:17:23,093 INFO L226 Difference]: Without dead ends: 515 [2025-03-03 14:17:23,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:23,096 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 13 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:23,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2482 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-03 14:17:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-03 14:17:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 395 states have (on average 1.6455696202531647) internal successors, (650), 411 states have internal predecessors, (650), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 843 transitions. [2025-03-03 14:17:23,113 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 843 transitions. Word has length 91 [2025-03-03 14:17:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 843 transitions. [2025-03-03 14:17:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-03 14:17:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 843 transitions. [2025-03-03 14:17:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:17:23,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:23,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:23,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:17:23,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:23,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1230893148, now seen corresponding path program 1 times [2025-03-03 14:17:23,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:23,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896201546] [2025-03-03 14:17:23,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:23,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:17:23,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:17:23,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:23,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:23,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:23,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896201546] [2025-03-03 14:17:23,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896201546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:23,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:23,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:23,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040600350] [2025-03-03 14:17:23,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:23,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:23,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:23,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:23,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:23,216 INFO L87 Difference]: Start difference. First operand 515 states and 843 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-03 14:17:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:23,278 INFO L93 Difference]: Finished difference Result 1014 states and 1672 transitions. [2025-03-03 14:17:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:23,278 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 92 [2025-03-03 14:17:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:23,285 INFO L225 Difference]: With dead ends: 1014 [2025-03-03 14:17:23,285 INFO L226 Difference]: Without dead ends: 515 [2025-03-03 14:17:23,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:23,287 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 12 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2484 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-03 14:17:23,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2484 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-03 14:17:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-03 14:17:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 395 states have (on average 1.6430379746835444) internal successors, (649), 411 states have internal predecessors, (649), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 842 transitions. [2025-03-03 14:17:23,324 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 842 transitions. Word has length 92 [2025-03-03 14:17:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:23,324 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 842 transitions. [2025-03-03 14:17:23,324 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-03 14:17:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 842 transitions. [2025-03-03 14:17:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:17:23,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:23,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:23,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:17:23,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:23,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1470166965, now seen corresponding path program 1 times [2025-03-03 14:17:23,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:23,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031375492] [2025-03-03 14:17:23,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:23,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:17:23,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:17:23,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:23,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:23,547 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-03 14:17:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031375492] [2025-03-03 14:17:23,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031375492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537297557] [2025-03-03 14:17:23,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:23,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:23,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:23,550 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-03 14:17:23,552 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-03 14:17:23,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:17:23,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:17:23,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:23,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:23,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:23,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:23,885 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-03 14:17:23,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:23,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537297557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:23,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:23,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021140895] [2025-03-03 14:17:23,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:23,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:23,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:23,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:23,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:23,887 INFO L87 Difference]: Start difference. First operand 515 states and 842 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:23,937 INFO L93 Difference]: Finished difference Result 1457 states and 2416 transitions. [2025-03-03 14:17:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:23,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-03-03 14:17:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:23,943 INFO L225 Difference]: With dead ends: 1457 [2025-03-03 14:17:23,944 INFO L226 Difference]: Without dead ends: 960 [2025-03-03 14:17:23,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 95 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-03 14:17:23,947 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 785 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1590 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-03 14:17:23,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1590 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-03 14:17:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 945. [2025-03-03 14:17:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 732 states have (on average 1.6584699453551912) internal successors, (1214), 763 states have internal predecessors, (1214), 172 states have call successors, (172), 41 states have call predecessors, (172), 40 states have return successors, (174), 166 states have call predecessors, (174), 169 states have call successors, (174) [2025-03-03 14:17:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1560 transitions. [2025-03-03 14:17:23,983 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1560 transitions. Word has length 93 [2025-03-03 14:17:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:23,983 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1560 transitions. [2025-03-03 14:17:23,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1560 transitions. [2025-03-03 14:17:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:17:24,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:24,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:24,016 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-03 14:17:24,206 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,SelfDestructingSolverStorable9 [2025-03-03 14:17:24,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:24,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1244739467, now seen corresponding path program 1 times [2025-03-03 14:17:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:24,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635727327] [2025-03-03 14:17:24,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:24,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:17:24,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:17:24,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:24,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:24,410 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-03 14:17:24,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:24,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635727327] [2025-03-03 14:17:24,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635727327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:24,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536766537] [2025-03-03 14:17:24,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:24,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:24,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:24,412 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-03 14:17:24,414 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-03 14:17:24,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:17:24,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:17:24,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:24,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:24,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:24,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:24,773 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-03 14:17:24,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:24,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536766537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:24,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:24,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:24,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144524947] [2025-03-03 14:17:24,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:24,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:24,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:24,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:24,776 INFO L87 Difference]: Start difference. First operand 945 states and 1560 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:24,857 INFO L93 Difference]: Finished difference Result 2317 states and 3854 transitions. [2025-03-03 14:17:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:24,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2025-03-03 14:17:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:24,867 INFO L225 Difference]: With dead ends: 2317 [2025-03-03 14:17:24,868 INFO L226 Difference]: Without dead ends: 1390 [2025-03-03 14:17:24,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 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-03 14:17:24,873 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 783 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1652 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-03 14:17:24,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1652 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-03 14:17:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1342. [2025-03-03 14:17:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1042 states have (on average 1.6727447216890594) internal successors, (1743), 1088 states have internal predecessors, (1743), 243 states have call successors, (243), 56 states have call predecessors, (243), 56 states have return successors, (250), 236 states have call predecessors, (250), 240 states have call successors, (250) [2025-03-03 14:17:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2236 transitions. [2025-03-03 14:17:24,936 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2236 transitions. Word has length 94 [2025-03-03 14:17:24,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:24,937 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 2236 transitions. [2025-03-03 14:17:24,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2236 transitions. [2025-03-03 14:17:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 14:17:24,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:24,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:24,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:25,142 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,SelfDestructingSolverStorable10 [2025-03-03 14:17:25,143 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:25,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:25,143 INFO L85 PathProgramCache]: Analyzing trace with hash 281465763, now seen corresponding path program 1 times [2025-03-03 14:17:25,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:25,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449852404] [2025-03-03 14:17:25,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:25,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 14:17:25,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 14:17:25,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:25,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449852404] [2025-03-03 14:17:25,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449852404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:25,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:25,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:25,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370362686] [2025-03-03 14:17:25,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:25,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:25,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:25,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:25,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:25,280 INFO L87 Difference]: Start difference. First operand 1342 states and 2236 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-03 14:17:25,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:25,801 INFO L93 Difference]: Finished difference Result 3962 states and 6727 transitions. [2025-03-03 14:17:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:25,802 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 96 [2025-03-03 14:17:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:25,824 INFO L225 Difference]: With dead ends: 3962 [2025-03-03 14:17:25,824 INFO L226 Difference]: Without dead ends: 2638 [2025-03-03 14:17:25,833 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-03 14:17:25,833 INFO L435 NwaCegarLoop]: 941 mSDtfsCounter, 837 mSDsluCounter, 3394 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 4335 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:25,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 4335 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:17:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2025-03-03 14:17:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2591. [2025-03-03 14:17:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 2017 states have (on average 1.677243430837878) internal successors, (3383), 2105 states have internal predecessors, (3383), 465 states have call successors, (465), 106 states have call predecessors, (465), 108 states have return successors, (559), 457 states have call predecessors, (559), 461 states have call successors, (559) [2025-03-03 14:17:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 4407 transitions. [2025-03-03 14:17:25,949 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 4407 transitions. Word has length 96 [2025-03-03 14:17:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:25,949 INFO L471 AbstractCegarLoop]: Abstraction has 2591 states and 4407 transitions. [2025-03-03 14:17:25,949 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-03 14:17:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 4407 transitions. [2025-03-03 14:17:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:17:25,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:25,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:17:25,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:25,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:25,954 INFO L85 PathProgramCache]: Analyzing trace with hash 141576774, now seen corresponding path program 1 times [2025-03-03 14:17:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:25,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171140207] [2025-03-03 14:17:25,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:25,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:25,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:17:25,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:17:25,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:25,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:26,167 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-03 14:17:26,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:26,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171140207] [2025-03-03 14:17:26,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171140207] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:26,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489516323] [2025-03-03 14:17:26,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:26,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:26,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:26,171 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-03 14:17:26,173 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-03 14:17:26,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:17:26,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:17:26,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:26,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:26,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:17:26,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:26,525 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-03 14:17:26,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:26,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489516323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:26,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:26,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121231121] [2025-03-03 14:17:26,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:26,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:26,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:26,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:26,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:26,527 INFO L87 Difference]: Start difference. First operand 2591 states and 4407 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:17:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:26,806 INFO L93 Difference]: Finished difference Result 7483 states and 12926 transitions. [2025-03-03 14:17:26,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:26,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-03-03 14:17:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:26,844 INFO L225 Difference]: With dead ends: 7483 [2025-03-03 14:17:26,844 INFO L226 Difference]: Without dead ends: 4911 [2025-03-03 14:17:26,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 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-03 14:17:26,864 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 695 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:26,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1619 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2025-03-03 14:17:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4874. [2025-03-03 14:17:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 3784 states have (on average 1.6448202959830867) internal successors, (6224), 3958 states have internal predecessors, (6224), 878 states have call successors, (878), 206 states have call predecessors, (878), 211 states have return successors, (1163), 865 states have call predecessors, (1163), 872 states have call successors, (1163) [2025-03-03 14:17:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 8265 transitions. [2025-03-03 14:17:27,142 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 8265 transitions. Word has length 97 [2025-03-03 14:17:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:27,142 INFO L471 AbstractCegarLoop]: Abstraction has 4874 states and 8265 transitions. [2025-03-03 14:17:27,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:17:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 8265 transitions. [2025-03-03 14:17:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:17:27,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:27,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:27,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:27,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:27,352 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:27,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash -606718538, now seen corresponding path program 1 times [2025-03-03 14:17:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618864111] [2025-03-03 14:17:27,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:27,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:27,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:27,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:27,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:27,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:27,601 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-03 14:17:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618864111] [2025-03-03 14:17:27,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618864111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60795480] [2025-03-03 14:17:27,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:27,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:27,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:27,604 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-03 14:17:27,605 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-03 14:17:27,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:27,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:27,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:27,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:27,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:17:27,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:27,885 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-03 14:17:27,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:27,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60795480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:27,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:27,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2025-03-03 14:17:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188734316] [2025-03-03 14:17:27,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:27,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:27,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:27,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:27,887 INFO L87 Difference]: Start difference. First operand 4874 states and 8265 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:28,260 INFO L93 Difference]: Finished difference Result 14508 states and 24928 transitions. [2025-03-03 14:17:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:28,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-03-03 14:17:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:28,319 INFO L225 Difference]: With dead ends: 14508 [2025-03-03 14:17:28,319 INFO L226 Difference]: Without dead ends: 9655 [2025-03-03 14:17:28,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:28,341 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 824 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:28,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1672 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9655 states. [2025-03-03 14:17:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9655 to 9552. [2025-03-03 14:17:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9552 states, 7444 states have (on average 1.6489790435249865) internal successors, (12275), 7772 states have internal predecessors, (12275), 1696 states have call successors, (1696), 394 states have call predecessors, (1696), 411 states have return successors, (2320), 1691 states have call predecessors, (2320), 1686 states have call successors, (2320) [2025-03-03 14:17:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9552 states to 9552 states and 16291 transitions. [2025-03-03 14:17:28,791 INFO L78 Accepts]: Start accepts. Automaton has 9552 states and 16291 transitions. Word has length 102 [2025-03-03 14:17:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:28,792 INFO L471 AbstractCegarLoop]: Abstraction has 9552 states and 16291 transitions. [2025-03-03 14:17:28,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:28,793 INFO L276 IsEmpty]: Start isEmpty. Operand 9552 states and 16291 transitions. [2025-03-03 14:17:28,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:17:28,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:28,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:28,805 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-03 14:17:28,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:28,998 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:28,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1112277163, now seen corresponding path program 1 times [2025-03-03 14:17:28,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:28,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544755101] [2025-03-03 14:17:28,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:28,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:29,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:29,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:29,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:29,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:29,223 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-03 14:17:29,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:29,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544755101] [2025-03-03 14:17:29,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544755101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:29,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062364305] [2025-03-03 14:17:29,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:29,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:29,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:29,226 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:29,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:17:29,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:29,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:29,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:29,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:29,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:17:29,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:29,584 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-03 14:17:29,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:29,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062364305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:29,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-03 14:17:29,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001504091] [2025-03-03 14:17:29,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:29,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:17:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:29,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:17:29,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:17:29,589 INFO L87 Difference]: Start difference. First operand 9552 states and 16291 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:17:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:30,239 INFO L93 Difference]: Finished difference Result 18037 states and 30844 transitions. [2025-03-03 14:17:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:17:30,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 102 [2025-03-03 14:17:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:30,301 INFO L225 Difference]: With dead ends: 18037 [2025-03-03 14:17:30,301 INFO L226 Difference]: Without dead ends: 8503 [2025-03-03 14:17:30,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 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-03 14:17:30,356 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 704 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 3403 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:30,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 3403 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:17:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2025-03-03 14:17:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 8481. [2025-03-03 14:17:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8481 states, 6629 states have (on average 1.6356916578669483) internal successors, (10843), 6904 states have internal predecessors, (10843), 1478 states have call successors, (1478), 358 states have call predecessors, (1478), 373 states have return successors, (1998), 1474 states have call predecessors, (1998), 1468 states have call successors, (1998) [2025-03-03 14:17:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 14319 transitions. [2025-03-03 14:17:30,770 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 14319 transitions. Word has length 102 [2025-03-03 14:17:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:30,771 INFO L471 AbstractCegarLoop]: Abstraction has 8481 states and 14319 transitions. [2025-03-03 14:17:30,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:17:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 14319 transitions. [2025-03-03 14:17:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:17:30,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:30,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:30,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:17:30,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:17:30,976 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:30,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash 864021933, now seen corresponding path program 1 times [2025-03-03 14:17:30,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:30,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562957393] [2025-03-03 14:17:30,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:30,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:31,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:31,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:31,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:31,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:31,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562957393] [2025-03-03 14:17:31,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562957393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:31,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:31,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:31,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941140200] [2025-03-03 14:17:31,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:31,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:31,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:31,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:31,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:31,068 INFO L87 Difference]: Start difference. First operand 8481 states and 14319 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:31,532 INFO L93 Difference]: Finished difference Result 16992 states and 29033 transitions. [2025-03-03 14:17:31,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:31,532 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-03-03 14:17:31,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:31,578 INFO L225 Difference]: With dead ends: 16992 [2025-03-03 14:17:31,579 INFO L226 Difference]: Without dead ends: 8529 [2025-03-03 14:17:31,618 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-03 14:17:31,619 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 12 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2450 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-03 14:17:31,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2450 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:31,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8529 states. [2025-03-03 14:17:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8529 to 8497. [2025-03-03 14:17:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8497 states, 6641 states have (on average 1.6339406715856046) internal successors, (10851), 6916 states have internal predecessors, (10851), 1478 states have call successors, (1478), 366 states have call predecessors, (1478), 377 states have return successors, (1972), 1470 states have call predecessors, (1972), 1468 states have call successors, (1972) [2025-03-03 14:17:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8497 states to 8497 states and 14301 transitions. [2025-03-03 14:17:31,905 INFO L78 Accepts]: Start accepts. Automaton has 8497 states and 14301 transitions. Word has length 102 [2025-03-03 14:17:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:31,906 INFO L471 AbstractCegarLoop]: Abstraction has 8497 states and 14301 transitions. [2025-03-03 14:17:31,906 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 8497 states and 14301 transitions. [2025-03-03 14:17:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:17:31,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:31,909 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:31,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:17:31,909 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:31,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:31,910 INFO L85 PathProgramCache]: Analyzing trace with hash 822332440, now seen corresponding path program 1 times [2025-03-03 14:17:31,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:31,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532763039] [2025-03-03 14:17:31,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:31,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:31,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:17:31,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:17:31,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:31,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:32,031 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-03 14:17:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532763039] [2025-03-03 14:17:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532763039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:32,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:32,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408792985] [2025-03-03 14:17:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:32,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:32,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:32,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:32,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:32,035 INFO L87 Difference]: Start difference. First operand 8497 states and 14301 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:17:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:32,877 INFO L93 Difference]: Finished difference Result 25437 states and 44069 transitions. [2025-03-03 14:17:32,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:32,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-03-03 14:17:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:32,996 INFO L225 Difference]: With dead ends: 25437 [2025-03-03 14:17:32,996 INFO L226 Difference]: Without dead ends: 16958 [2025-03-03 14:17:33,051 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-03 14:17:33,052 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 830 mSDsluCounter, 3391 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 4329 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:33,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 4329 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16958 states. [2025-03-03 14:17:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16958 to 16857. [2025-03-03 14:17:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16857 states, 13188 states have (on average 1.6304215953897483) internal successors, (21502), 13729 states have internal predecessors, (21502), 2911 states have call successors, (2911), 726 states have call predecessors, (2911), 757 states have return successors, (4613), 2913 states have call predecessors, (4613), 2893 states have call successors, (4613) [2025-03-03 14:17:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16857 states to 16857 states and 29026 transitions. [2025-03-03 14:17:33,685 INFO L78 Accepts]: Start accepts. Automaton has 16857 states and 29026 transitions. Word has length 110 [2025-03-03 14:17:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:33,686 INFO L471 AbstractCegarLoop]: Abstraction has 16857 states and 29026 transitions. [2025-03-03 14:17:33,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:17:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 16857 states and 29026 transitions. [2025-03-03 14:17:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:17:33,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:33,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:33,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:17:33,690 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:33,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash 160818716, now seen corresponding path program 1 times [2025-03-03 14:17:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034439706] [2025-03-03 14:17:33,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:33,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:17:33,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:17:33,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:33,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:33,761 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-03 14:17:33,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:33,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034439706] [2025-03-03 14:17:33,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034439706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:33,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:33,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:33,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869760074] [2025-03-03 14:17:33,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:33,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:33,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:33,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:33,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:33,763 INFO L87 Difference]: Start difference. First operand 16857 states and 29026 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:17:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:34,755 INFO L93 Difference]: Finished difference Result 33840 states and 59275 transitions. [2025-03-03 14:17:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:34,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-03-03 14:17:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:34,890 INFO L225 Difference]: With dead ends: 33840 [2025-03-03 14:17:34,890 INFO L226 Difference]: Without dead ends: 17001 [2025-03-03 14:17:35,051 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-03 14:17:35,052 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 12 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2444 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:35,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2444 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17001 states. [2025-03-03 14:17:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17001 to 16937. [2025-03-03 14:17:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16937 states, 13260 states have (on average 1.6276018099547511) internal successors, (21582), 13785 states have internal predecessors, (21582), 2911 states have call successors, (2911), 758 states have call predecessors, (2911), 765 states have return successors, (4573), 2905 states have call predecessors, (4573), 2893 states have call successors, (4573) [2025-03-03 14:17:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16937 states to 16937 states and 29066 transitions. [2025-03-03 14:17:35,811 INFO L78 Accepts]: Start accepts. Automaton has 16937 states and 29066 transitions. Word has length 111 [2025-03-03 14:17:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:35,812 INFO L471 AbstractCegarLoop]: Abstraction has 16937 states and 29066 transitions. [2025-03-03 14:17:35,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:17:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16937 states and 29066 transitions. [2025-03-03 14:17:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:17:35,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:35,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:35,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:17:35,817 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:35,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:35,817 INFO L85 PathProgramCache]: Analyzing trace with hash 825089760, now seen corresponding path program 1 times [2025-03-03 14:17:35,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:35,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658482668] [2025-03-03 14:17:35,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:35,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:35,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:17:35,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:17:35,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:35,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:35,925 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-03 14:17:35,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:35,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658482668] [2025-03-03 14:17:35,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658482668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:35,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:35,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:35,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105846745] [2025-03-03 14:17:35,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:35,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:35,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:35,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:35,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:35,928 INFO L87 Difference]: Start difference. First operand 16937 states and 29066 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:17:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:37,570 INFO L93 Difference]: Finished difference Result 50897 states and 91033 transitions. [2025-03-03 14:17:37,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:37,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-03 14:17:37,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:37,852 INFO L225 Difference]: With dead ends: 50897 [2025-03-03 14:17:37,852 INFO L226 Difference]: Without dead ends: 33978 [2025-03-03 14:17:37,985 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-03 14:17:37,985 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 827 mSDsluCounter, 3390 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 4324 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:37,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 4324 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:17:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33978 states. [2025-03-03 14:17:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33978 to 33813. [2025-03-03 14:17:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33813 states, 26483 states have (on average 1.6239474379790808) internal successors, (43007), 27524 states have internal predecessors, (43007), 5788 states have call successors, (5788), 1510 states have call predecessors, (5788), 1541 states have return successors, (11190), 5802 states have call predecessors, (11190), 5754 states have call successors, (11190) [2025-03-03 14:17:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33813 states to 33813 states and 59985 transitions. [2025-03-03 14:17:39,569 INFO L78 Accepts]: Start accepts. Automaton has 33813 states and 59985 transitions. Word has length 120 [2025-03-03 14:17:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:39,570 INFO L471 AbstractCegarLoop]: Abstraction has 33813 states and 59985 transitions. [2025-03-03 14:17:39,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:17:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 33813 states and 59985 transitions. [2025-03-03 14:17:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:17:39,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:39,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:39,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:17:39,576 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:39,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2077968915, now seen corresponding path program 1 times [2025-03-03 14:17:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761404928] [2025-03-03 14:17:39,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:39,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:39,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:17:39,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:17:39,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:39,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:39,659 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-03 14:17:39,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:39,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761404928] [2025-03-03 14:17:39,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761404928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:39,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:39,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:39,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777719924] [2025-03-03 14:17:39,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:39,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:39,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:39,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:39,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:39,661 INFO L87 Difference]: Start difference. First operand 33813 states and 59985 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:17:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:41,768 INFO L93 Difference]: Finished difference Result 67896 states and 123769 transitions. [2025-03-03 14:17:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:41,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-03-03 14:17:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:41,998 INFO L225 Difference]: With dead ends: 67896 [2025-03-03 14:17:41,998 INFO L226 Difference]: Without dead ends: 34101 [2025-03-03 14:17:42,306 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-03 14:17:42,308 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 11 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2447 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:42,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2447 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34101 states. [2025-03-03 14:17:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34101 to 33973. [2025-03-03 14:17:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33973 states, 26627 states have (on average 1.6211739963195253) internal successors, (43167), 27668 states have internal predecessors, (43167), 5788 states have call successors, (5788), 1542 states have call predecessors, (5788), 1557 states have return successors, (11134), 5786 states have call predecessors, (11134), 5754 states have call successors, (11134) [2025-03-03 14:17:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33973 states to 33973 states and 60089 transitions. [2025-03-03 14:17:43,951 INFO L78 Accepts]: Start accepts. Automaton has 33973 states and 60089 transitions. Word has length 121 [2025-03-03 14:17:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:43,952 INFO L471 AbstractCegarLoop]: Abstraction has 33973 states and 60089 transitions. [2025-03-03 14:17:43,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:17:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 33973 states and 60089 transitions. [2025-03-03 14:17:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:17:43,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:43,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:43,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:17:43,959 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:43,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:43,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1990435591, now seen corresponding path program 1 times [2025-03-03 14:17:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:43,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084155085] [2025-03-03 14:17:43,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:43,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:43,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:17:43,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:17:43,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:43,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:44,166 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-03 14:17:44,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:44,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084155085] [2025-03-03 14:17:44,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084155085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:44,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:44,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:44,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143418342] [2025-03-03 14:17:44,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:44,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:44,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:44,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:44,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:44,168 INFO L87 Difference]: Start difference. First operand 33973 states and 60089 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:17:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:47,914 INFO L93 Difference]: Finished difference Result 102241 states and 192795 transitions. [2025-03-03 14:17:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:47,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2025-03-03 14:17:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:48,726 INFO L225 Difference]: With dead ends: 102241 [2025-03-03 14:17:48,727 INFO L226 Difference]: Without dead ends: 68286 [2025-03-03 14:17:49,259 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-03 14:17:49,260 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 822 mSDsluCounter, 3407 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 4344 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:49,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 4344 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68286 states. [2025-03-03 14:17:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68286 to 67993. [2025-03-03 14:17:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67993 states, 53298 states have (on average 1.618372171563661) internal successors, (86256), 55371 states have internal predecessors, (86256), 11553 states have call successors, (11553), 3078 states have call predecessors, (11553), 3141 states have return successors, (28935), 11591 states have call predecessors, (28935), 11487 states have call successors, (28935) [2025-03-03 14:17:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67993 states to 67993 states and 126744 transitions. [2025-03-03 14:17:52,971 INFO L78 Accepts]: Start accepts. Automaton has 67993 states and 126744 transitions. Word has length 131 [2025-03-03 14:17:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:52,971 INFO L471 AbstractCegarLoop]: Abstraction has 67993 states and 126744 transitions. [2025-03-03 14:17:52,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:17:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 67993 states and 126744 transitions. [2025-03-03 14:17:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:17:52,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:52,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:52,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:17:52,977 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:52,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1658716223, now seen corresponding path program 1 times [2025-03-03 14:17:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:52,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133037599] [2025-03-03 14:17:52,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:52,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:17:53,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:17:53,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:53,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:53,060 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-03 14:17:53,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:53,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133037599] [2025-03-03 14:17:53,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133037599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:53,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:53,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:53,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002102858] [2025-03-03 14:17:53,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:53,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:53,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:53,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:53,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:53,062 INFO L87 Difference]: Start difference. First operand 67993 states and 126744 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:17:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:58,374 INFO L93 Difference]: Finished difference Result 136608 states and 266175 transitions. [2025-03-03 14:17:58,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:58,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-03-03 14:17:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:59,214 INFO L225 Difference]: With dead ends: 136608 [2025-03-03 14:17:59,215 INFO L226 Difference]: Without dead ends: 68633 [2025-03-03 14:18:00,372 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-03 14:18:00,373 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 9 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:00,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2444 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68633 states. [2025-03-03 14:18:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68633 to 68377. [2025-03-03 14:18:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68377 states, 53650 states have (on average 1.6149114631873251) internal successors, (86640), 55723 states have internal predecessors, (86640), 11553 states have call successors, (11553), 3142 states have call predecessors, (11553), 3173 states have return successors, (28871), 11559 states have call predecessors, (28871), 11487 states have call successors, (28871) [2025-03-03 14:18:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68377 states to 68377 states and 127064 transitions. [2025-03-03 14:18:03,832 INFO L78 Accepts]: Start accepts. Automaton has 68377 states and 127064 transitions. Word has length 132 [2025-03-03 14:18:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:03,833 INFO L471 AbstractCegarLoop]: Abstraction has 68377 states and 127064 transitions. [2025-03-03 14:18:03,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:18:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 68377 states and 127064 transitions. [2025-03-03 14:18:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:18:03,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:03,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:03,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:18:03,841 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:03,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1222126335, now seen corresponding path program 1 times [2025-03-03 14:18:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:03,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630638543] [2025-03-03 14:18:03,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:03,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:03,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:18:03,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:18:03,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:03,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:04,240 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-03 14:18:04,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:04,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630638543] [2025-03-03 14:18:04,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630638543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:04,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:04,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:18:04,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961003308] [2025-03-03 14:18:04,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:04,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:18:04,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:04,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:18:04,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:04,242 INFO L87 Difference]: Start difference. First operand 68377 states and 127064 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:18:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:09,585 INFO L93 Difference]: Finished difference Result 140119 states and 267051 transitions. [2025-03-03 14:18:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:09,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 143 [2025-03-03 14:18:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted.