./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_product18.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b60f36c6abb85551baa468c8faf905605a37519376312e75fd6944689b1d0b8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:17:32,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:17:32,924 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:32,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:17:32,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:17:32,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:17:32,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:17:32,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:17:32,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:17:32,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:17:32,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:17:32,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:17:32,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:17:32,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:17:32,952 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:17:32,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:17:32,953 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:17:32,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:17:32,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:17:32,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:17:32,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:17:32,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:17:32,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:17:32,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:17:32,955 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:17:32,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:17:32,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:17:32,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:17:32,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:17:32,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:17:32,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:17:32,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:17:32,955 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b60f36c6abb85551baa468c8faf905605a37519376312e75fd6944689b1d0b8d [2025-03-03 14:17:33,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:17:33,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:17:33,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:17:33,207 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:17:33,208 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:17:33,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c [2025-03-03 14:17:34,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1280f1371/f5fa37d131bf4e0a8cde35e996110416/FLAG60d9a25aa [2025-03-03 14:17:34,704 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:17:34,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c [2025-03-03 14:17:34,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1280f1371/f5fa37d131bf4e0a8cde35e996110416/FLAG60d9a25aa [2025-03-03 14:17:34,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1280f1371/f5fa37d131bf4e0a8cde35e996110416 [2025-03-03 14:17:34,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:17:34,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:17:34,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:17:34,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:17:34,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:17:34,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:17:34" (1/1) ... [2025-03-03 14:17:34,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a01e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:34, skipping insertion in model container [2025-03-03 14:17:34,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:17:34" (1/1) ... [2025-03-03 14:17:34,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:17:35,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c[32398,32411] [2025-03-03 14:17:35,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:17:35,388 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:17:35,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-03 14:17:35,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [86] [2025-03-03 14:17:35,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [452] [2025-03-03 14:17:35,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1120] [2025-03-03 14:17:35,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1476] [2025-03-03 14:17:35,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1485] [2025-03-03 14:17:35,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2984] [2025-03-03 14:17:35,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [3102] [2025-03-03 14:17:35,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3288] [2025-03-03 14:17:35,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3303] [2025-03-03 14:17:35,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c[32398,32411] [2025-03-03 14:17:35,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:17:35,492 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:17:35,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:35 WrapperNode [2025-03-03 14:17:35,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:17:35,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:17:35,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:17:35,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:17:35,499 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:35" (1/1) ... [2025-03-03 14:17:35,515 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:35" (1/1) ... [2025-03-03 14:17:35,551 INFO L138 Inliner]: procedures = 90, calls = 344, calls flagged for inlining = 25, calls inlined = 21, statements flattened = 815 [2025-03-03 14:17:35,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:17:35,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:17:35,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:17:35,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:17:35,559 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:35" (1/1) ... [2025-03-03 14:17:35,559 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:35" (1/1) ... [2025-03-03 14:17:35,565 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:35" (1/1) ... [2025-03-03 14:17:35,592 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:17:35,592 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:35" (1/1) ... [2025-03-03 14:17:35,593 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:35" (1/1) ... [2025-03-03 14:17:35,614 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:35" (1/1) ... [2025-03-03 14:17:35,616 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:35" (1/1) ... [2025-03-03 14:17:35,620 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:35" (1/1) ... [2025-03-03 14:17:35,622 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:35" (1/1) ... [2025-03-03 14:17:35,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:17:35,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:17:35,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:17:35,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:17:35,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:35" (1/1) ... [2025-03-03 14:17:35,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:17:35,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:35,658 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:35,663 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:35,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:17:35,678 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-03 14:17:35,679 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-03 14:17:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:17:35,679 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:17:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:17:35,679 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:17:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:17:35,679 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:17:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-03 14:17:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-03 14:17:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:17:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:17:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:17:35,681 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:17:35,681 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:17:35,681 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:17:35,681 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:17:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:17:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:17:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:17:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:17:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:17:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:17:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:17:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-03 14:17:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-03 14:17:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:17:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:17:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:17:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:17:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-03 14:17:35,683 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-03 14:17:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:17:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:17:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:17:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2025-03-03 14:17:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2025-03-03 14:17:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:17:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:17:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:17:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:17:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:17:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:17:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:17:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:17:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:17:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:17:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:17:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:17:35,820 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:17:35,821 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:17:35,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: #res := ~retValue_acc~14; [2025-03-03 14:17:35,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3099: #res := ~retValue_acc~25; [2025-03-03 14:17:35,887 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3021: #res := ~retValue_acc~23; [2025-03-03 14:17:35,892 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565: #res := ~retValue_acc~10; [2025-03-03 14:17:36,198 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: #res := ~retValue_acc~18; [2025-03-03 14:17:36,259 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2359: #res := ~retValue_acc~21; [2025-03-03 14:17:36,268 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: #res := ~retValue_acc~24; [2025-03-03 14:17:36,359 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2345-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-03-03 14:17:36,370 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1761: #res := ~retValue_acc~13; [2025-03-03 14:17:36,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-03 14:17:36,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-03 14:17:36,534 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1718-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~11#1; [2025-03-03 14:17:36,535 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2025-03-03 14:17:36,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L806: #res := ~retValue_acc~6; [2025-03-03 14:17:36,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-03 14:17:36,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1473-1: main_#res#1 := main_~retValue_acc~9#1; [2025-03-03 14:17:36,637 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: #res := ~retValue_acc~5; [2025-03-03 14:17:36,640 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1117: #res := ~retValue_acc~7; [2025-03-03 14:17:36,772 INFO L? ?]: Removed 439 outVars from TransFormulas that were not future-live. [2025-03-03 14:17:36,772 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:17:36,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:17:36,786 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:17:36,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:17:36 BoogieIcfgContainer [2025-03-03 14:17:36,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:17:36,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:17:36,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:17:36,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:17:36,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:17:34" (1/3) ... [2025-03-03 14:17:36,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33767dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:17:36, skipping insertion in model container [2025-03-03 14:17:36,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:35" (2/3) ... [2025-03-03 14:17:36,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33767dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:17:36, skipping insertion in model container [2025-03-03 14:17:36,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:17:36" (3/3) ... [2025-03-03 14:17:36,797 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product18.cil.c [2025-03-03 14:17:36,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:17:36,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product18.cil.c that has 26 procedures, 568 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:17:36,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:17:36,873 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;@700186da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:17:36,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:17:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 568 states, 439 states have (on average 1.683371298405467) internal successors, (739), 459 states have internal predecessors, (739), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 14:17:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:17:36,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:36,887 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:36,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:36,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:36,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1968764064, now seen corresponding path program 1 times [2025-03-03 14:17:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:36,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367605998] [2025-03-03 14:17:36,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:36,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:36,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:17:37,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:17:37,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:37,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:37,460 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:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367605998] [2025-03-03 14:17:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367605998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:37,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:37,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73014519] [2025-03-03 14:17:37,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:37,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:37,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:37,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:37,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:37,480 INFO L87 Difference]: Start difference. First operand has 568 states, 439 states have (on average 1.683371298405467) internal successors, (739), 459 states have internal predecessors, (739), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:37,670 INFO L93 Difference]: Finished difference Result 1133 states and 1898 transitions. [2025-03-03 14:17:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:37,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-03-03 14:17:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:37,687 INFO L225 Difference]: With dead ends: 1133 [2025-03-03 14:17:37,687 INFO L226 Difference]: Without dead ends: 573 [2025-03-03 14:17:37,706 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:37,708 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 91 mSDsluCounter, 4559 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5488 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:37,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5488 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:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-03 14:17:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 571. [2025-03-03 14:17:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 442 states have (on average 1.6764705882352942) internal successors, (741), 462 states have internal predecessors, (741), 103 states have call successors, (103), 25 states have call predecessors, (103), 25 states have return successors, (102), 97 states have call predecessors, (102), 100 states have call successors, (102) [2025-03-03 14:17:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 946 transitions. [2025-03-03 14:17:37,785 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 946 transitions. Word has length 63 [2025-03-03 14:17:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:37,786 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 946 transitions. [2025-03-03 14:17:37,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 946 transitions. [2025-03-03 14:17:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:17:37,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:37,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:37,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:17:37,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:37,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash 892109275, now seen corresponding path program 1 times [2025-03-03 14:17:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:37,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411149064] [2025-03-03 14:17:37,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:37,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:17:37,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:17:37,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:37,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:37,924 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:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411149064] [2025-03-03 14:17:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411149064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:37,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:37,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:37,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783738462] [2025-03-03 14:17:37,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:37,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:37,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:37,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:37,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:37,928 INFO L87 Difference]: Start difference. First operand 571 states and 946 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:17:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:37,988 INFO L93 Difference]: Finished difference Result 1124 states and 1873 transitions. [2025-03-03 14:17:37,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:37,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-03 14:17:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:37,997 INFO L225 Difference]: With dead ends: 1124 [2025-03-03 14:17:37,998 INFO L226 Difference]: Without dead ends: 547 [2025-03-03 14:17:38,000 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:38,002 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 14 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2743 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:38,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2743 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:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-03 14:17:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-03 14:17:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 421 states have (on average 1.667458432304038) internal successors, (702), 439 states have internal predecessors, (702), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 14:17:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 903 transitions. [2025-03-03 14:17:38,043 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 903 transitions. Word has length 64 [2025-03-03 14:17:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:38,043 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 903 transitions. [2025-03-03 14:17:38,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:17:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 903 transitions. [2025-03-03 14:17:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:17:38,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:38,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:38,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:17:38,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:38,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1805670225, now seen corresponding path program 1 times [2025-03-03 14:17:38,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:38,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98942454] [2025-03-03 14:17:38,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:38,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:38,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:17:38,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:17:38,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:38,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:38,295 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:38,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:38,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98942454] [2025-03-03 14:17:38,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98942454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:38,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:38,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:38,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431171720] [2025-03-03 14:17:38,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:38,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:38,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:38,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:38,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:38,298 INFO L87 Difference]: Start difference. First operand 547 states and 903 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:38,376 INFO L93 Difference]: Finished difference Result 1087 states and 1805 transitions. [2025-03-03 14:17:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:38,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2025-03-03 14:17:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:38,382 INFO L225 Difference]: With dead ends: 1087 [2025-03-03 14:17:38,382 INFO L226 Difference]: Without dead ends: 541 [2025-03-03 14:17:38,385 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:38,386 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 77 mSDsluCounter, 4390 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5282 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:38,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5282 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:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-03 14:17:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-03-03 14:17:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 415 states have (on average 1.6602409638554216) internal successors, (689), 433 states have internal predecessors, (689), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 14:17:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 890 transitions. [2025-03-03 14:17:38,415 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 890 transitions. Word has length 64 [2025-03-03 14:17:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:38,416 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 890 transitions. [2025-03-03 14:17:38,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 890 transitions. [2025-03-03 14:17:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:17:38,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:38,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:38,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:17:38,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:38,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:38,418 INFO L85 PathProgramCache]: Analyzing trace with hash -677469158, now seen corresponding path program 1 times [2025-03-03 14:17:38,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:38,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036845103] [2025-03-03 14:17:38,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:38,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:38,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:17:38,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:17:38,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:38,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:38,583 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:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:38,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036845103] [2025-03-03 14:17:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036845103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:38,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431250368] [2025-03-03 14:17:38,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:38,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:38,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:38,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:38,586 INFO L87 Difference]: Start difference. First operand 541 states and 890 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:38,663 INFO L93 Difference]: Finished difference Result 1075 states and 1779 transitions. [2025-03-03 14:17:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:38,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 14:17:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:38,668 INFO L225 Difference]: With dead ends: 1075 [2025-03-03 14:17:38,668 INFO L226 Difference]: Without dead ends: 535 [2025-03-03 14:17:38,670 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:38,670 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 63 mSDsluCounter, 4342 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5222 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:38,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5222 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:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-03 14:17:38,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-03 14:17:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 409 states have (on average 1.6528117359413204) internal successors, (676), 427 states have internal predecessors, (676), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 14:17:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 877 transitions. [2025-03-03 14:17:38,692 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 877 transitions. Word has length 65 [2025-03-03 14:17:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:38,692 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 877 transitions. [2025-03-03 14:17:38,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 877 transitions. [2025-03-03 14:17:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:17:38,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:38,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:38,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:17:38,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:38,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2067576373, now seen corresponding path program 1 times [2025-03-03 14:17:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:38,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073272261] [2025-03-03 14:17:38,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:38,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:38,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:17:38,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:17:38,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:38,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:38,828 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:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:38,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073272261] [2025-03-03 14:17:38,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073272261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:38,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:38,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:38,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330877373] [2025-03-03 14:17:38,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:38,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:38,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:38,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:38,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:38,830 INFO L87 Difference]: Start difference. First operand 535 states and 877 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:38,883 INFO L93 Difference]: Finished difference Result 1063 states and 1753 transitions. [2025-03-03 14:17:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:38,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-03 14:17:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:38,887 INFO L225 Difference]: With dead ends: 1063 [2025-03-03 14:17:38,887 INFO L226 Difference]: Without dead ends: 529 [2025-03-03 14:17:38,890 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:38,890 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 49 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5162 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:38,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5162 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-03 14:17:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-03 14:17:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6451612903225807) internal successors, (663), 421 states have internal predecessors, (663), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 14:17:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 864 transitions. [2025-03-03 14:17:38,911 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 864 transitions. Word has length 66 [2025-03-03 14:17:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:38,911 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 864 transitions. [2025-03-03 14:17:38,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 864 transitions. [2025-03-03 14:17:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:17:38,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:38,913 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:38,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:17:38,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:38,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:38,914 INFO L85 PathProgramCache]: Analyzing trace with hash -780562941, now seen corresponding path program 1 times [2025-03-03 14:17:38,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:38,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626261511] [2025-03-03 14:17:38,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:38,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:38,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:17:38,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:17:38,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:38,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:39,068 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:39,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:39,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626261511] [2025-03-03 14:17:39,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626261511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:39,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:39,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664359724] [2025-03-03 14:17:39,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:39,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:39,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:39,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:39,070 INFO L87 Difference]: Start difference. First operand 529 states and 864 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:39,123 INFO L93 Difference]: Finished difference Result 1051 states and 1727 transitions. [2025-03-03 14:17:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:39,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-03 14:17:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:39,128 INFO L225 Difference]: With dead ends: 1051 [2025-03-03 14:17:39,128 INFO L226 Difference]: Without dead ends: 529 [2025-03-03 14:17:39,130 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:39,131 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 24 mSDsluCounter, 4258 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5114 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:39,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5114 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-03 14:17:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-03 14:17:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6426799007444168) internal successors, (662), 421 states have internal predecessors, (662), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 14:17:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 863 transitions. [2025-03-03 14:17:39,152 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 863 transitions. Word has length 66 [2025-03-03 14:17:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:39,154 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 863 transitions. [2025-03-03 14:17:39,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 863 transitions. [2025-03-03 14:17:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:17:39,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:39,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:39,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:17:39,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:39,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash 361542548, now seen corresponding path program 1 times [2025-03-03 14:17:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532653456] [2025-03-03 14:17:39,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:39,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:39,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:17:39,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:17:39,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:39,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:39,255 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:39,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532653456] [2025-03-03 14:17:39,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532653456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:39,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:39,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:39,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643739164] [2025-03-03 14:17:39,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:39,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:39,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:39,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:39,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:39,257 INFO L87 Difference]: Start difference. First operand 529 states and 863 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:17:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:39,295 INFO L93 Difference]: Finished difference Result 1042 states and 1712 transitions. [2025-03-03 14:17:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:39,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-03 14:17:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:39,299 INFO L225 Difference]: With dead ends: 1042 [2025-03-03 14:17:39,299 INFO L226 Difference]: Without dead ends: 529 [2025-03-03 14:17:39,301 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:39,302 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 15 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2529 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:39,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2529 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:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-03 14:17:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-03 14:17:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6401985111662531) internal successors, (661), 421 states have internal predecessors, (661), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 14:17:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 862 transitions. [2025-03-03 14:17:39,321 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 862 transitions. Word has length 67 [2025-03-03 14:17:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 862 transitions. [2025-03-03 14:17:39,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:17:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 862 transitions. [2025-03-03 14:17:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:17:39,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:39,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:39,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:17:39,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:39,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash -458561421, now seen corresponding path program 1 times [2025-03-03 14:17:39,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:39,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548756270] [2025-03-03 14:17:39,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:39,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:17:39,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:17:39,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:39,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:39,393 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:39,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:39,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548756270] [2025-03-03 14:17:39,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548756270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:39,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:39,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:39,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590068016] [2025-03-03 14:17:39,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:39,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:39,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:39,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:39,395 INFO L87 Difference]: Start difference. First operand 529 states and 862 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:17:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:39,429 INFO L93 Difference]: Finished difference Result 1042 states and 1710 transitions. [2025-03-03 14:17:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:39,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-03 14:17:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:39,433 INFO L225 Difference]: With dead ends: 1042 [2025-03-03 14:17:39,433 INFO L226 Difference]: Without dead ends: 529 [2025-03-03 14:17:39,435 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:39,435 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 14 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2531 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:39,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2531 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:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-03 14:17:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-03 14:17:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6377171215880892) internal successors, (660), 421 states have internal predecessors, (660), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 14:17:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 861 transitions. [2025-03-03 14:17:39,450 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 861 transitions. Word has length 68 [2025-03-03 14:17:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:39,450 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 861 transitions. [2025-03-03 14:17:39,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:17:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 861 transitions. [2025-03-03 14:17:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:17:39,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:39,451 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:17:39,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2007866999, now seen corresponding path program 1 times [2025-03-03 14:17:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:39,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599266391] [2025-03-03 14:17:39,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:39,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:17:39,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:17:39,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:39,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:39,533 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:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599266391] [2025-03-03 14:17:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599266391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:39,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:39,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:39,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945199086] [2025-03-03 14:17:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:39,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:39,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:39,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:39,535 INFO L87 Difference]: Start difference. First operand 529 states and 861 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:17:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:39,573 INFO L93 Difference]: Finished difference Result 1042 states and 1708 transitions. [2025-03-03 14:17:39,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:39,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-03 14:17:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:39,577 INFO L225 Difference]: With dead ends: 1042 [2025-03-03 14:17:39,577 INFO L226 Difference]: Without dead ends: 529 [2025-03-03 14:17:39,579 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:39,580 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 13 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2533 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:39,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2533 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:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-03 14:17:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-03 14:17:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6352357320099256) internal successors, (659), 421 states have internal predecessors, (659), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 14:17:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 860 transitions. [2025-03-03 14:17:39,597 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 860 transitions. Word has length 69 [2025-03-03 14:17:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:39,597 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 860 transitions. [2025-03-03 14:17:39,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:17:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 860 transitions. [2025-03-03 14:17:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:17:39,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:39,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:39,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:17:39,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:39,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:39,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1017382922, now seen corresponding path program 1 times [2025-03-03 14:17:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:39,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001630323] [2025-03-03 14:17:39,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:39,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:39,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:17:39,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:17:39,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:39,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:39,680 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:39,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:39,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001630323] [2025-03-03 14:17:39,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001630323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:39,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:39,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977506886] [2025-03-03 14:17:39,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:39,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:39,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:39,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:39,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:39,682 INFO L87 Difference]: Start difference. First operand 529 states and 860 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:17:39,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:39,716 INFO L93 Difference]: Finished difference Result 1042 states and 1706 transitions. [2025-03-03 14:17:39,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:39,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-03 14:17:39,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:39,720 INFO L225 Difference]: With dead ends: 1042 [2025-03-03 14:17:39,720 INFO L226 Difference]: Without dead ends: 529 [2025-03-03 14:17:39,723 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:39,723 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 12 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2535 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:39,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2535 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:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-03 14:17:39,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-03 14:17:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6327543424317619) internal successors, (658), 421 states have internal predecessors, (658), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 14:17:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 859 transitions. [2025-03-03 14:17:39,740 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 859 transitions. Word has length 70 [2025-03-03 14:17:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:39,741 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 859 transitions. [2025-03-03 14:17:39,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:17:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 859 transitions. [2025-03-03 14:17:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:17:39,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:39,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:39,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:17:39,742 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:39,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1808997722, now seen corresponding path program 1 times [2025-03-03 14:17:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:39,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639711079] [2025-03-03 14:17:39,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:39,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:39,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:17:39,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:17:39,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:39,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:39,859 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:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639711079] [2025-03-03 14:17:39,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639711079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:39,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884141479] [2025-03-03 14:17:39,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:39,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:39,862 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:39,864 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:39,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:17:40,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:17:40,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:40,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:40,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:40,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:40,143 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:40,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:40,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884141479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:40,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:40,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:17:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546522879] [2025-03-03 14:17:40,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:40,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:40,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:40,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:40,147 INFO L87 Difference]: Start difference. First operand 529 states and 859 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:40,211 INFO L93 Difference]: Finished difference Result 1499 states and 2467 transitions. [2025-03-03 14:17:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:40,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 71 [2025-03-03 14:17:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:40,219 INFO L225 Difference]: With dead ends: 1499 [2025-03-03 14:17:40,219 INFO L226 Difference]: Without dead ends: 988 [2025-03-03 14:17:40,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:40,223 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 824 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1624 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:40,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1624 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:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-03-03 14:17:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 973. [2025-03-03 14:17:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 748 states have (on average 1.6470588235294117) internal successors, (1232), 783 states have internal predecessors, (1232), 180 states have call successors, (180), 45 states have call predecessors, (180), 44 states have return successors, (182), 172 states have call predecessors, (182), 177 states have call successors, (182) [2025-03-03 14:17:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1594 transitions. [2025-03-03 14:17:40,257 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1594 transitions. Word has length 71 [2025-03-03 14:17:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:40,258 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1594 transitions. [2025-03-03 14:17:40,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1594 transitions. [2025-03-03 14:17:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:17:40,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:40,259 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:40,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:40,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:17:40,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:40,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:40,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2095401490, now seen corresponding path program 1 times [2025-03-03 14:17:40,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:40,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195683868] [2025-03-03 14:17:40,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:40,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:40,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:17:40,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:17:40,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:40,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:40,589 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:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195683868] [2025-03-03 14:17:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195683868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876955244] [2025-03-03 14:17:40,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:40,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:40,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:40,592 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:40,594 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:40,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:17:40,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:17:40,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:40,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:40,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:40,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:40,873 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:40,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:40,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876955244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:40,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:40,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:17:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006191652] [2025-03-03 14:17:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:40,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:40,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:40,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:40,874 INFO L87 Difference]: Start difference. First operand 973 states and 1594 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:40,931 INFO L93 Difference]: Finished difference Result 2387 states and 3939 transitions. [2025-03-03 14:17:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:40,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2025-03-03 14:17:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:40,939 INFO L225 Difference]: With dead ends: 2387 [2025-03-03 14:17:40,939 INFO L226 Difference]: Without dead ends: 1432 [2025-03-03 14:17:40,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:40,944 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 822 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1682 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:40,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1682 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:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-03-03 14:17:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1384. [2025-03-03 14:17:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1066 states have (on average 1.6604127579737336) internal successors, (1770), 1118 states have internal predecessors, (1770), 255 states have call successors, (255), 62 states have call predecessors, (255), 62 states have return successors, (262), 245 states have call predecessors, (262), 252 states have call successors, (262) [2025-03-03 14:17:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2287 transitions. [2025-03-03 14:17:40,993 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2287 transitions. Word has length 72 [2025-03-03 14:17:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:40,994 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2287 transitions. [2025-03-03 14:17:40,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2287 transitions. [2025-03-03 14:17:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:17:40,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:40,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:41,003 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:41,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:17:41,196 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:41,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash -974306584, now seen corresponding path program 1 times [2025-03-03 14:17:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:41,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245023923] [2025-03-03 14:17:41,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:41,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:41,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:17:41,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:17:41,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:41,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:41,329 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:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245023923] [2025-03-03 14:17:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245023923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:41,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743505770] [2025-03-03 14:17:41,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:41,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:41,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:41,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:41,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:41,330 INFO L87 Difference]: Start difference. First operand 1384 states and 2287 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:41,777 INFO L93 Difference]: Finished difference Result 4088 states and 6886 transitions. [2025-03-03 14:17:41,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:41,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2025-03-03 14:17:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:41,798 INFO L225 Difference]: With dead ends: 4088 [2025-03-03 14:17:41,799 INFO L226 Difference]: Without dead ends: 2722 [2025-03-03 14:17:41,806 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:41,806 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 850 mSDsluCounter, 3496 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:41,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 4468 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2025-03-03 14:17:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2675. [2025-03-03 14:17:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2065 states have (on average 1.664406779661017) internal successors, (3437), 2165 states have internal predecessors, (3437), 489 states have call successors, (489), 118 states have call predecessors, (489), 120 states have return successors, (577), 475 states have call predecessors, (577), 485 states have call successors, (577) [2025-03-03 14:17:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 4503 transitions. [2025-03-03 14:17:41,948 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 4503 transitions. Word has length 74 [2025-03-03 14:17:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:41,948 INFO L471 AbstractCegarLoop]: Abstraction has 2675 states and 4503 transitions. [2025-03-03 14:17:41,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 4503 transitions. [2025-03-03 14:17:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:17:41,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:41,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:41,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:17:41,949 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:41,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash -191047273, now seen corresponding path program 1 times [2025-03-03 14:17:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21675367] [2025-03-03 14:17:41,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:41,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:41,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:17:41,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:17:41,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:41,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:42,077 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:42,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21675367] [2025-03-03 14:17:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21675367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051477820] [2025-03-03 14:17:42,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:42,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:42,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:42,080 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:42,081 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:42,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:17:42,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:17:42,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:42,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:42,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:17:42,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:42,394 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:42,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:42,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051477820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:42,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:42,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-03 14:17:42,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993820925] [2025-03-03 14:17:42,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:42,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:17:42,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:42,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:17:42,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:42,396 INFO L87 Difference]: Start difference. First operand 2675 states and 4503 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 14:17:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:42,770 INFO L93 Difference]: Finished difference Result 7216 states and 12348 transitions. [2025-03-03 14:17:42,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:17:42,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2025-03-03 14:17:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:42,797 INFO L225 Difference]: With dead ends: 7216 [2025-03-03 14:17:42,797 INFO L226 Difference]: Without dead ends: 4559 [2025-03-03 14:17:42,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:17:42,813 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 723 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:42,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 3381 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:17:42,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2025-03-03 14:17:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 4516. [2025-03-03 14:17:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4516 states, 3484 states have (on average 1.6165327210103329) internal successors, (5632), 3650 states have internal predecessors, (5632), 814 states have call successors, (814), 210 states have call predecessors, (814), 217 states have return successors, (1070), 795 states have call predecessors, (1070), 808 states have call successors, (1070) [2025-03-03 14:17:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 7516 transitions. [2025-03-03 14:17:42,987 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 7516 transitions. Word has length 75 [2025-03-03 14:17:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:42,987 INFO L471 AbstractCegarLoop]: Abstraction has 4516 states and 7516 transitions. [2025-03-03 14:17:42,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 14:17:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 7516 transitions. [2025-03-03 14:17:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:17:42,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:42,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:42,996 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:43,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:43,193 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:43,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:43,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1334365037, now seen corresponding path program 1 times [2025-03-03 14:17:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058465365] [2025-03-03 14:17:43,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:43,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:17:43,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:17:43,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:43,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:43,252 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:43,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:43,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058465365] [2025-03-03 14:17:43,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058465365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:43,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:43,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:43,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804785319] [2025-03-03 14:17:43,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:43,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:43,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:43,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:43,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:43,254 INFO L87 Difference]: Start difference. First operand 4516 states and 7516 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:43,466 INFO L93 Difference]: Finished difference Result 9038 states and 15197 transitions. [2025-03-03 14:17:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2025-03-03 14:17:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:43,498 INFO L225 Difference]: With dead ends: 9038 [2025-03-03 14:17:43,499 INFO L226 Difference]: Without dead ends: 4540 [2025-03-03 14:17:43,522 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:43,524 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 12 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2501 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:43,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2501 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4540 states. [2025-03-03 14:17:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4540 to 4524. [2025-03-03 14:17:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 3490 states have (on average 1.6148997134670486) internal successors, (5636), 3656 states have internal predecessors, (5636), 814 states have call successors, (814), 214 states have call predecessors, (814), 219 states have return successors, (1057), 793 states have call predecessors, (1057), 808 states have call successors, (1057) [2025-03-03 14:17:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 7507 transitions. [2025-03-03 14:17:43,705 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 7507 transitions. Word has length 75 [2025-03-03 14:17:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:43,706 INFO L471 AbstractCegarLoop]: Abstraction has 4524 states and 7507 transitions. [2025-03-03 14:17:43,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 7507 transitions. [2025-03-03 14:17:43,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:17:43,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:43,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:43,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:17:43,707 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:43,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1736821385, now seen corresponding path program 1 times [2025-03-03 14:17:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542630228] [2025-03-03 14:17:43,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:43,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:43,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:17:43,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:17:43,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:43,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:43,843 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:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542630228] [2025-03-03 14:17:43,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542630228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:43,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:43,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:43,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136112488] [2025-03-03 14:17:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:43,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:43,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:43,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:43,844 INFO L87 Difference]: Start difference. First operand 4524 states and 7507 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:17:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:44,502 INFO L93 Difference]: Finished difference Result 13523 states and 23249 transitions. [2025-03-03 14:17:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2025-03-03 14:17:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:44,565 INFO L225 Difference]: With dead ends: 13523 [2025-03-03 14:17:44,566 INFO L226 Difference]: Without dead ends: 9017 [2025-03-03 14:17:44,589 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:44,590 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 845 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 4308 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:44,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 4308 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2025-03-03 14:17:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 8948. [2025-03-03 14:17:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8948 states, 6910 states have (on average 1.612590448625181) internal successors, (11143), 7236 states have internal predecessors, (11143), 1600 states have call successors, (1600), 422 states have call predecessors, (1600), 437 states have return successors, (2521), 1569 states have call predecessors, (2521), 1590 states have call successors, (2521) [2025-03-03 14:17:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8948 states to 8948 states and 15264 transitions. [2025-03-03 14:17:44,982 INFO L78 Accepts]: Start accepts. Automaton has 8948 states and 15264 transitions. Word has length 83 [2025-03-03 14:17:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:44,982 INFO L471 AbstractCegarLoop]: Abstraction has 8948 states and 15264 transitions. [2025-03-03 14:17:44,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:17:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8948 states and 15264 transitions. [2025-03-03 14:17:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 14:17:44,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:44,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:44,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:17:44,984 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:44,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1947663851, now seen corresponding path program 1 times [2025-03-03 14:17:44,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:44,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274037280] [2025-03-03 14:17:44,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:44,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:44,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:17:45,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:17:45,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:45,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:45,051 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:45,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:45,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274037280] [2025-03-03 14:17:45,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274037280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:45,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294128144] [2025-03-03 14:17:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:45,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:45,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:45,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:45,053 INFO L87 Difference]: Start difference. First operand 8948 states and 15264 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:17:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:45,441 INFO L93 Difference]: Finished difference Result 17950 states and 31081 transitions. [2025-03-03 14:17:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:45,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-03 14:17:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:45,491 INFO L225 Difference]: With dead ends: 17950 [2025-03-03 14:17:45,492 INFO L226 Difference]: Without dead ends: 9020 [2025-03-03 14:17:45,521 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:45,522 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 12 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2495 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:45,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2495 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:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9020 states. [2025-03-03 14:17:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9020 to 8988. [2025-03-03 14:17:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8988 states, 6946 states have (on average 1.6099913619349266) internal successors, (11183), 7264 states have internal predecessors, (11183), 1600 states have call successors, (1600), 438 states have call predecessors, (1600), 441 states have return successors, (2501), 1565 states have call predecessors, (2501), 1590 states have call successors, (2501) [2025-03-03 14:17:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8988 states to 8988 states and 15284 transitions. [2025-03-03 14:17:45,851 INFO L78 Accepts]: Start accepts. Automaton has 8988 states and 15284 transitions. Word has length 84 [2025-03-03 14:17:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:45,852 INFO L471 AbstractCegarLoop]: Abstraction has 8988 states and 15284 transitions. [2025-03-03 14:17:45,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:17:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 8988 states and 15284 transitions. [2025-03-03 14:17:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:17:45,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:45,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:45,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:17:45,854 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:45,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:45,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1261667104, now seen corresponding path program 1 times [2025-03-03 14:17:45,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:45,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245071751] [2025-03-03 14:17:45,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:45,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:45,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:17:45,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:17:45,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:45,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:45,955 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:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:45,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245071751] [2025-03-03 14:17:45,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245071751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:45,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:45,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436143203] [2025-03-03 14:17:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:45,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:45,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:45,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:45,957 INFO L87 Difference]: Start difference. First operand 8988 states and 15284 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:46,932 INFO L93 Difference]: Finished difference Result 26987 states and 48345 transitions. [2025-03-03 14:17:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:46,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-03-03 14:17:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:47,065 INFO L225 Difference]: With dead ends: 26987 [2025-03-03 14:17:47,065 INFO L226 Difference]: Without dead ends: 18017 [2025-03-03 14:17:47,123 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:47,124 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 842 mSDsluCounter, 3375 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 4301 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:47,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 4301 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:17:47,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18017 states. [2025-03-03 14:17:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18017 to 17916. [2025-03-03 14:17:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17916 states, 13852 states have (on average 1.6070603522956974) internal successors, (22261), 14482 states have internal predecessors, (22261), 3178 states have call successors, (3178), 870 states have call predecessors, (3178), 885 states have return successors, (6322), 3123 states have call predecessors, (6322), 3160 states have call successors, (6322) [2025-03-03 14:17:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17916 states to 17916 states and 31761 transitions. [2025-03-03 14:17:47,936 INFO L78 Accepts]: Start accepts. Automaton has 17916 states and 31761 transitions. Word has length 93 [2025-03-03 14:17:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:47,938 INFO L471 AbstractCegarLoop]: Abstraction has 17916 states and 31761 transitions. [2025-03-03 14:17:47,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17916 states and 31761 transitions. [2025-03-03 14:17:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:17:47,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:47,940 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:47,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:17:47,940 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:47,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:47,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1561710441, now seen corresponding path program 1 times [2025-03-03 14:17:47,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:47,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144409089] [2025-03-03 14:17:47,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:47,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:47,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:17:47,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:17:47,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:47,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:48,010 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:48,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:48,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144409089] [2025-03-03 14:17:48,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144409089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:48,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:48,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:48,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213697796] [2025-03-03 14:17:48,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:48,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:48,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:48,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:48,013 INFO L87 Difference]: Start difference. First operand 17916 states and 31761 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:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:48,719 INFO L93 Difference]: Finished difference Result 35958 states and 65266 transitions. [2025-03-03 14:17:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:48,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2025-03-03 14:17:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:48,845 INFO L225 Difference]: With dead ends: 35958 [2025-03-03 14:17:48,845 INFO L226 Difference]: Without dead ends: 18060 [2025-03-03 14:17:48,943 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:48,944 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 11 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2498 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:48,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2498 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:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18060 states. [2025-03-03 14:17:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18060 to 17996. [2025-03-03 14:17:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17996 states, 13924 states have (on average 1.6044958345303073) internal successors, (22341), 14554 states have internal predecessors, (22341), 3178 states have call successors, (3178), 886 states have call predecessors, (3178), 893 states have return successors, (6294), 3115 states have call predecessors, (6294), 3160 states have call successors, (6294) [2025-03-03 14:17:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17996 states to 17996 states and 31813 transitions. [2025-03-03 14:17:49,586 INFO L78 Accepts]: Start accepts. Automaton has 17996 states and 31813 transitions. Word has length 94 [2025-03-03 14:17:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:49,587 INFO L471 AbstractCegarLoop]: Abstraction has 17996 states and 31813 transitions. [2025-03-03 14:17:49,587 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:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 17996 states and 31813 transitions. [2025-03-03 14:17:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:17:49,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:49,589 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:49,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:17:49,590 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:49,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash 702101118, now seen corresponding path program 1 times [2025-03-03 14:17:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051957917] [2025-03-03 14:17:49,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:49,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:17:49,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:17:49,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:49,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:49,876 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:49,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:49,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051957917] [2025-03-03 14:17:49,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051957917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:49,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:49,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:49,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602494853] [2025-03-03 14:17:49,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:49,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:49,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:49,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:49,878 INFO L87 Difference]: Start difference. First operand 17996 states and 31813 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:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:51,474 INFO L93 Difference]: Finished difference Result 54131 states and 103424 transitions. [2025-03-03 14:17:51,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:51,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2025-03-03 14:17:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:51,844 INFO L225 Difference]: With dead ends: 54131 [2025-03-03 14:17:51,845 INFO L226 Difference]: Without dead ends: 36153 [2025-03-03 14:17:51,993 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:51,994 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 836 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 4273 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:51,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 4273 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36153 states. [2025-03-03 14:17:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36153 to 35988. [2025-03-03 14:17:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35988 states, 27850 states have (on average 1.6021184919210054) internal successors, (44619), 29104 states have internal predecessors, (44619), 6340 states have call successors, (6340), 1766 states have call predecessors, (6340), 1797 states have return successors, (16763), 6237 states have call predecessors, (16763), 6306 states have call successors, (16763) [2025-03-03 14:17:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35988 states to 35988 states and 67722 transitions. [2025-03-03 14:17:53,633 INFO L78 Accepts]: Start accepts. Automaton has 35988 states and 67722 transitions. Word has length 104 [2025-03-03 14:17:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:53,634 INFO L471 AbstractCegarLoop]: Abstraction has 35988 states and 67722 transitions. [2025-03-03 14:17:53,634 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:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 35988 states and 67722 transitions. [2025-03-03 14:17:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:17:53,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:53,636 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:53,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:17:53,636 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:53,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2078124659, now seen corresponding path program 1 times [2025-03-03 14:17:53,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:53,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971104208] [2025-03-03 14:17:53,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:53,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:53,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:17:53,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:17:53,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:53,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 14:17:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971104208] [2025-03-03 14:17:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971104208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616319821] [2025-03-03 14:17:53,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:53,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:53,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:53,969 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:53,971 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:54,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:17:54,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:17:54,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:54,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:54,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:17:54,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:17:54,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616319821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-03 14:17:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020755688] [2025-03-03 14:17:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:54,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:17:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:54,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:17:54,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:17:54,342 INFO L87 Difference]: Start difference. First operand 35988 states and 67722 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:18:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:01,072 INFO L93 Difference]: Finished difference Result 128737 states and 263522 transitions. [2025-03-03 14:18:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:18:01,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 129 [2025-03-03 14:18:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:01,847 INFO L225 Difference]: With dead ends: 128737 [2025-03-03 14:18:01,847 INFO L226 Difference]: Without dead ends: 92767 [2025-03-03 14:18:02,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:18:02,085 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 2405 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 6332 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 2404 SdHoareTripleChecker+Invalid, 6826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 6332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:02,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2572 Valid, 2404 Invalid, 6826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 6332 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 14:18:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92767 states. [2025-03-03 14:18:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92767 to 91494. [2025-03-03 14:18:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91494 states, 70872 states have (on average 1.5944660796929675) internal successors, (113003), 73910 states have internal predecessors, (113003), 15880 states have call successors, (15880), 4406 states have call predecessors, (15880), 4741 states have return successors, (52120), 15913 states have call predecessors, (52120), 15814 states have call successors, (52120) [2025-03-03 14:18:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91494 states to 91494 states and 181003 transitions. [2025-03-03 14:18:06,751 INFO L78 Accepts]: Start accepts. Automaton has 91494 states and 181003 transitions. Word has length 129 [2025-03-03 14:18:06,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:06,753 INFO L471 AbstractCegarLoop]: Abstraction has 91494 states and 181003 transitions. [2025-03-03 14:18:06,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:18:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 91494 states and 181003 transitions. [2025-03-03 14:18:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:18:06,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:06,754 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:06,764 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:18:06,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:06,959 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:06,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1749749294, now seen corresponding path program 1 times [2025-03-03 14:18:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34002448] [2025-03-03 14:18:06,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:06,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:18:06,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:18:06,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:06,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:07,029 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:18:07,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:07,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34002448] [2025-03-03 14:18:07,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34002448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:07,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:07,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663600120] [2025-03-03 14:18:07,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:07,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:07,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:07,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:07,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:07,031 INFO L87 Difference]: Start difference. First operand 91494 states and 181003 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:18:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:12,826 INFO L93 Difference]: Finished difference Result 183866 states and 381329 transitions. [2025-03-03 14:18:12,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:12,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2025-03-03 14:18:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:13,879 INFO L225 Difference]: With dead ends: 183866 [2025-03-03 14:18:13,879 INFO L226 Difference]: Without dead ends: 92390 [2025-03-03 14:18:14,705 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:14,706 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 10 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:14,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2495 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92390 states. [2025-03-03 14:18:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92390 to 92070. [2025-03-03 14:18:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92070 states, 71400 states have (on average 1.5907422969187675) internal successors, (113579), 74438 states have internal predecessors, (113579), 15880 states have call successors, (15880), 4502 states have call predecessors, (15880), 4789 states have return successors, (52056), 15865 states have call predecessors, (52056), 15814 states have call successors, (52056) [2025-03-03 14:18:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92070 states to 92070 states and 181515 transitions. [2025-03-03 14:18:19,736 INFO L78 Accepts]: Start accepts. Automaton has 92070 states and 181515 transitions. Word has length 105 [2025-03-03 14:18:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:19,736 INFO L471 AbstractCegarLoop]: Abstraction has 92070 states and 181515 transitions. [2025-03-03 14:18:19,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:18:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 92070 states and 181515 transitions. [2025-03-03 14:18:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:18:19,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:19,738 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:19,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:18:19,738 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:19,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -971717961, now seen corresponding path program 1 times [2025-03-03 14:18:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:19,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009310531] [2025-03-03 14:18:19,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:19,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:19,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:18:19,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:18:19,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:19,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:19,858 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:19,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:19,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009310531] [2025-03-03 14:18:19,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009310531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:19,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:19,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:18:19,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689780254] [2025-03-03 14:18:19,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:19,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:18:19,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:19,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:18:19,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:19,861 INFO L87 Difference]: Start difference. First operand 92070 states and 181515 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)