./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product11.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 8e809cb7921b0f8738511433928ba20d09f78a0d0fe23412d97e6052fa9e13ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:25:30,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:25:30,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:25:30,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:25:30,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:25:30,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:25:30,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:25:30,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:25:30,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:25:30,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:25:30,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:25:30,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:25:30,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:25:30,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:25:30,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:25:30,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:25:30,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:25:30,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:25:30,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:25:30,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:25:30,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:25:30,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:30,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:25:30,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:25:30,327 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:25:30,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:25:30,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:25:30,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:25:30,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:25:30,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:25:30,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:25:30,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:25:30,327 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 -> 8e809cb7921b0f8738511433928ba20d09f78a0d0fe23412d97e6052fa9e13ec [2025-03-08 05:25:30,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:25:30,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:25:30,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:25:30,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:25:30,567 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:25:30,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c [2025-03-08 05:25:31,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abfe3231/8779fc82e4214c86ac926288cf34decd/FLAGc90cc6ee2 [2025-03-08 05:25:32,074 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:25:32,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c [2025-03-08 05:25:32,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abfe3231/8779fc82e4214c86ac926288cf34decd/FLAGc90cc6ee2 [2025-03-08 05:25:32,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abfe3231/8779fc82e4214c86ac926288cf34decd [2025-03-08 05:25:32,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:25:32,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:25:32,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:32,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:25:32,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:25:32,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a46283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32, skipping insertion in model container [2025-03-08 05:25:32,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:25:32,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c[1545,1558] [2025-03-08 05:25:32,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:32,558 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:25:32,564 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-08 05:25:32,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [57] [2025-03-08 05:25:32,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [421] [2025-03-08 05:25:32,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [541] [2025-03-08 05:25:32,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [907] [2025-03-08 05:25:32,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2442] [2025-03-08 05:25:32,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2533] [2025-03-08 05:25:32,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2714] [2025-03-08 05:25:32,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3375] [2025-03-08 05:25:32,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3387] [2025-03-08 05:25:32,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c[1545,1558] [2025-03-08 05:25:32,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:32,679 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:25:32,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32 WrapperNode [2025-03-08 05:25:32,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:32,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:32,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:25:32,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:25:32,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,736 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 1125 [2025-03-08 05:25:32,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:32,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:25:32,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:25:32,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:25:32,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,774 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:25:32,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:25:32,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:25:32,809 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:25:32,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:25:32,810 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (1/1) ... [2025-03-08 05:25:32,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:32,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:32,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:25:32,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:25:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:25:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:25:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:25:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-08 05:25:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:25:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:25:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:25:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:25:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:25:32,857 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:25:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:25:32,858 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:25:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:25:32,858 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:25:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:25:32,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:25:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:25:32,858 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:25:33,014 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:25:33,017 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:25:33,061 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: #res := ~retValue_acc~4; [2025-03-08 05:25:33,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: #res := ~retValue_acc~8; [2025-03-08 05:25:33,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1145: #res := ~retValue_acc~9; [2025-03-08 05:25:33,144 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1801: #res#1 := ~retValue_acc~19#1; [2025-03-08 05:25:33,148 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~11#1; [2025-03-08 05:25:33,154 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2430: #res := ~retValue_acc~23; [2025-03-08 05:25:33,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1682-1: stopRequestedInDirection__wrappee__empty_#res#1 := stopRequestedInDirection__wrappee__empty_~retValue_acc~16#1; [2025-03-08 05:25:33,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1711: #res#1 := ~retValue_acc~17#1; [2025-03-08 05:25:33,466 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846: #res := ~retValue_acc~21; [2025-03-08 05:25:33,475 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L499: #res := ~retValue_acc~3; [2025-03-08 05:25:33,514 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237-1: isEmpty_#res#1 := isEmpty_~retValue_acc~13#1; [2025-03-08 05:25:33,564 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; [2025-03-08 05:25:33,564 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1330-1: isIdle_#res#1 := isIdle_~retValue_acc~15#1; [2025-03-08 05:25:33,683 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1832-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-03-08 05:25:33,730 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3061: #res := ~retValue_acc~26; [2025-03-08 05:25:33,789 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3419-1: valid_product_#res#1 := valid_product_~retValue_acc~29#1; [2025-03-08 05:25:33,789 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L418-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-08 05:25:33,798 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2825: #res := ~retValue_acc~25; [2025-03-08 05:25:33,800 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1154: #res := ~retValue_acc~10; [2025-03-08 05:25:33,804 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3372: #res := ~retValue_acc~27; [2025-03-08 05:25:33,916 INFO L? ?]: Removed 443 outVars from TransFormulas that were not future-live. [2025-03-08 05:25:33,916 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:25:33,937 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:25:33,941 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:25:33,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:33 BoogieIcfgContainer [2025-03-08 05:25:33,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:25:33,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:25:33,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:25:33,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:25:33,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:25:32" (1/3) ... [2025-03-08 05:25:33,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6f36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:33, skipping insertion in model container [2025-03-08 05:25:33,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:32" (2/3) ... [2025-03-08 05:25:33,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6f36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:33, skipping insertion in model container [2025-03-08 05:25:33,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:33" (3/3) ... [2025-03-08 05:25:33,951 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product11.cil.c [2025-03-08 05:25:33,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:25:33,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product11.cil.c that has 24 procedures, 552 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:25:34,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:25:34,029 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;@56ee189a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:25:34,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:25:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 552 states, 433 states have (on average 1.697459584295612) internal successors, (735), 454 states have internal predecessors, (735), 94 states have call successors, (94), 23 states have call predecessors, (94), 23 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-08 05:25:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:25:34,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:34,051 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:25:34,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:34,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1375345715, now seen corresponding path program 1 times [2025-03-08 05:25:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:34,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255483126] [2025-03-08 05:25:34,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:34,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:34,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:25:34,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:25:34,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:34,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255483126] [2025-03-08 05:25:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255483126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:34,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:34,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972335734] [2025-03-08 05:25:34,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:34,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:34,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:34,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:34,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:34,582 INFO L87 Difference]: Start difference. First operand has 552 states, 433 states have (on average 1.697459584295612) internal successors, (735), 454 states have internal predecessors, (735), 94 states have call successors, (94), 23 states have call predecessors, (94), 23 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:34,718 INFO L93 Difference]: Finished difference Result 1084 states and 1821 transitions. [2025-03-08 05:25:34,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:34,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-03-08 05:25:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:34,740 INFO L225 Difference]: With dead ends: 1084 [2025-03-08 05:25:34,740 INFO L226 Difference]: Without dead ends: 544 [2025-03-08 05:25:34,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:34,751 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 5 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:34,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2705 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-08 05:25:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-03-08 05:25:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 427 states have (on average 1.6955503512880563) internal successors, (724), 446 states have internal predecessors, (724), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 907 transitions. [2025-03-08 05:25:34,817 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 907 transitions. Word has length 102 [2025-03-08 05:25:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:34,817 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 907 transitions. [2025-03-08 05:25:34,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 907 transitions. [2025-03-08 05:25:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:25:34,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:34,825 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:25:34,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:25:34,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:34,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash -690576292, now seen corresponding path program 1 times [2025-03-08 05:25:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:34,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899516992] [2025-03-08 05:25:34,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:34,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:25:34,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:25:34,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:34,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:35,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:35,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899516992] [2025-03-08 05:25:35,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899516992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:35,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:35,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:35,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803259621] [2025-03-08 05:25:35,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:35,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:35,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:35,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:35,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:35,013 INFO L87 Difference]: Start difference. First operand 544 states and 907 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:35,078 INFO L93 Difference]: Finished difference Result 1070 states and 1791 transitions. [2025-03-08 05:25:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-03-08 05:25:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:35,083 INFO L225 Difference]: With dead ends: 1070 [2025-03-08 05:25:35,083 INFO L226 Difference]: Without dead ends: 544 [2025-03-08 05:25:35,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:35,086 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 4 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:35,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2684 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-08 05:25:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-03-08 05:25:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 427 states have (on average 1.693208430913349) internal successors, (723), 446 states have internal predecessors, (723), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 906 transitions. [2025-03-08 05:25:35,123 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 906 transitions. Word has length 104 [2025-03-08 05:25:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:35,123 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 906 transitions. [2025-03-08 05:25:35,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 906 transitions. [2025-03-08 05:25:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:25:35,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:35,128 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:25:35,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:25:35,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:35,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1697016394, now seen corresponding path program 1 times [2025-03-08 05:25:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519089557] [2025-03-08 05:25:35,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:35,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:35,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:25:35,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:25:35,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:35,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:35,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:35,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519089557] [2025-03-08 05:25:35,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519089557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:35,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414398172] [2025-03-08 05:25:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:35,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:35,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:35,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:35,277 INFO L87 Difference]: Start difference. First operand 544 states and 906 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:35,354 INFO L93 Difference]: Finished difference Result 1070 states and 1790 transitions. [2025-03-08 05:25:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:35,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-03-08 05:25:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:35,361 INFO L225 Difference]: With dead ends: 1070 [2025-03-08 05:25:35,362 INFO L226 Difference]: Without dead ends: 544 [2025-03-08 05:25:35,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:35,368 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 3 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:35,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2684 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-08 05:25:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-03-08 05:25:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 427 states have (on average 1.6908665105386418) internal successors, (722), 446 states have internal predecessors, (722), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 905 transitions. [2025-03-08 05:25:35,393 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 905 transitions. Word has length 105 [2025-03-08 05:25:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:35,393 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 905 transitions. [2025-03-08 05:25:35,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 905 transitions. [2025-03-08 05:25:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:25:35,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:35,396 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:25:35,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:25:35,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:35,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:35,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1756154911, now seen corresponding path program 1 times [2025-03-08 05:25:35,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381148983] [2025-03-08 05:25:35,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:35,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:35,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:25:35,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:25:35,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:35,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:35,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381148983] [2025-03-08 05:25:35,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381148983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:35,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:35,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:35,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691139409] [2025-03-08 05:25:35,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:35,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:35,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:35,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:35,566 INFO L87 Difference]: Start difference. First operand 544 states and 905 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:35,613 INFO L93 Difference]: Finished difference Result 1070 states and 1789 transitions. [2025-03-08 05:25:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:35,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-03-08 05:25:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:35,619 INFO L225 Difference]: With dead ends: 1070 [2025-03-08 05:25:35,619 INFO L226 Difference]: Without dead ends: 544 [2025-03-08 05:25:35,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:35,621 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 2 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:35,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2684 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-08 05:25:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-03-08 05:25:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 427 states have (on average 1.6885245901639345) internal successors, (721), 446 states have internal predecessors, (721), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 904 transitions. [2025-03-08 05:25:35,644 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 904 transitions. Word has length 106 [2025-03-08 05:25:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:35,644 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 904 transitions. [2025-03-08 05:25:35,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 904 transitions. [2025-03-08 05:25:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:25:35,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:35,648 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:25:35,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:25:35,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:35,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1647309075, now seen corresponding path program 1 times [2025-03-08 05:25:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:35,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695805785] [2025-03-08 05:25:35,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:35,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:25:35,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:25:35,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:35,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:35,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:35,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695805785] [2025-03-08 05:25:35,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695805785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:35,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:35,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:35,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731200142] [2025-03-08 05:25:35,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:35,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:35,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:35,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:35,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:35,788 INFO L87 Difference]: Start difference. First operand 544 states and 904 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:35,832 INFO L93 Difference]: Finished difference Result 1070 states and 1788 transitions. [2025-03-08 05:25:35,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:35,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-03-08 05:25:35,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:35,838 INFO L225 Difference]: With dead ends: 1070 [2025-03-08 05:25:35,838 INFO L226 Difference]: Without dead ends: 544 [2025-03-08 05:25:35,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:35,842 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 1 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:35,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2684 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-08 05:25:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-03-08 05:25:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 427 states have (on average 1.6861826697892273) internal successors, (720), 446 states have internal predecessors, (720), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 903 transitions. [2025-03-08 05:25:35,869 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 903 transitions. Word has length 107 [2025-03-08 05:25:35,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:35,869 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 903 transitions. [2025-03-08 05:25:35,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 903 transitions. [2025-03-08 05:25:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:25:35,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:35,872 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:25:35,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:25:35,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:35,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash -722300958, now seen corresponding path program 1 times [2025-03-08 05:25:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:35,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841799322] [2025-03-08 05:25:35,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:35,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:25:35,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:25:35,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:35,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:36,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841799322] [2025-03-08 05:25:36,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841799322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:36,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:36,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:25:36,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888449782] [2025-03-08 05:25:36,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:36,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:25:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:36,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:25:36,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:36,093 INFO L87 Difference]: Start difference. First operand 544 states and 903 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:25:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:36,215 INFO L93 Difference]: Finished difference Result 1036 states and 1720 transitions. [2025-03-08 05:25:36,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:36,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-08 05:25:36,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:36,221 INFO L225 Difference]: With dead ends: 1036 [2025-03-08 05:25:36,221 INFO L226 Difference]: Without dead ends: 559 [2025-03-08 05:25:36,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:36,224 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 91 mSDsluCounter, 6154 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7045 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:36,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7045 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-08 05:25:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 557. [2025-03-08 05:25:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 437 states have (on average 1.6819221967963387) internal successors, (735), 458 states have internal predecessors, (735), 95 states have call successors, (95), 23 states have call predecessors, (95), 24 states have return successors, (92), 88 states have call predecessors, (92), 90 states have call successors, (92) [2025-03-08 05:25:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 922 transitions. [2025-03-08 05:25:36,250 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 922 transitions. Word has length 108 [2025-03-08 05:25:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:36,250 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 922 transitions. [2025-03-08 05:25:36,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:25:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 922 transitions. [2025-03-08 05:25:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:25:36,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:36,255 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:25:36,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:25:36,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:36,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:36,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1692591965, now seen corresponding path program 1 times [2025-03-08 05:25:36,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:36,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070520982] [2025-03-08 05:25:36,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:36,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:25:36,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:25:36,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:36,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:36,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:36,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070520982] [2025-03-08 05:25:36,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070520982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:36,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:36,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:36,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128757110] [2025-03-08 05:25:36,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:36,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:36,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:36,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:36,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:36,348 INFO L87 Difference]: Start difference. First operand 557 states and 922 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:36,392 INFO L93 Difference]: Finished difference Result 1088 states and 1814 transitions. [2025-03-08 05:25:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:36,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-03-08 05:25:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:36,396 INFO L225 Difference]: With dead ends: 1088 [2025-03-08 05:25:36,396 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:25:36,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:36,398 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 0 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:36,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2686 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:25:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-03-08 05:25:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 421 states have (on average 1.676959619952494) internal successors, (706), 440 states have internal predecessors, (706), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 889 transitions. [2025-03-08 05:25:36,414 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 889 transitions. Word has length 108 [2025-03-08 05:25:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:36,414 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 889 transitions. [2025-03-08 05:25:36,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 889 transitions. [2025-03-08 05:25:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:25:36,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:36,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:36,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:25:36,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1562969055, now seen corresponding path program 1 times [2025-03-08 05:25:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978472344] [2025-03-08 05:25:36,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:36,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:25:36,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:25:36,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:36,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:36,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:36,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978472344] [2025-03-08 05:25:36,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978472344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:36,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:36,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:36,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518227460] [2025-03-08 05:25:36,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:36,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:36,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:36,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:36,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:36,544 INFO L87 Difference]: Start difference. First operand 538 states and 889 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:36,700 INFO L93 Difference]: Finished difference Result 1033 states and 1712 transitions. [2025-03-08 05:25:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:36,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-03-08 05:25:36,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:36,705 INFO L225 Difference]: With dead ends: 1033 [2025-03-08 05:25:36,705 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 05:25:36,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:36,708 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 55 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:36,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4201 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:36,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 05:25:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 538. [2025-03-08 05:25:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 421 states have (on average 1.667458432304038) internal successors, (702), 440 states have internal predecessors, (702), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 885 transitions. [2025-03-08 05:25:36,729 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 885 transitions. Word has length 109 [2025-03-08 05:25:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:36,729 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 885 transitions. [2025-03-08 05:25:36,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 885 transitions. [2025-03-08 05:25:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:25:36,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:36,732 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:25:36,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:25:36,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:36,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 269659339, now seen corresponding path program 1 times [2025-03-08 05:25:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692210201] [2025-03-08 05:25:36,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:36,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:36,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:25:36,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:25:36,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:36,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:36,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692210201] [2025-03-08 05:25:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692210201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:36,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:36,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033055696] [2025-03-08 05:25:36,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:36,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:36,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:36,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:36,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:36,855 INFO L87 Difference]: Start difference. First operand 538 states and 885 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:36,992 INFO L93 Difference]: Finished difference Result 1033 states and 1708 transitions. [2025-03-08 05:25:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-03-08 05:25:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:36,996 INFO L225 Difference]: With dead ends: 1033 [2025-03-08 05:25:36,996 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 05:25:36,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:36,998 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 54 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:36,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4201 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 05:25:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 538. [2025-03-08 05:25:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 421 states have (on average 1.657957244655582) internal successors, (698), 440 states have internal predecessors, (698), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 881 transitions. [2025-03-08 05:25:37,014 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 881 transitions. Word has length 110 [2025-03-08 05:25:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:37,014 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 881 transitions. [2025-03-08 05:25:37,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 881 transitions. [2025-03-08 05:25:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:25:37,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:37,016 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-08 05:25:37,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:25:37,017 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:37,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:37,017 INFO L85 PathProgramCache]: Analyzing trace with hash 578000062, now seen corresponding path program 1 times [2025-03-08 05:25:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:37,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458014781] [2025-03-08 05:25:37,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:37,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:25:37,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:25:37,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:37,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:37,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:37,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458014781] [2025-03-08 05:25:37,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458014781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:37,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:37,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525431874] [2025-03-08 05:25:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:37,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:37,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:37,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:37,154 INFO L87 Difference]: Start difference. First operand 538 states and 881 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:37,294 INFO L93 Difference]: Finished difference Result 1033 states and 1704 transitions. [2025-03-08 05:25:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:37,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2025-03-08 05:25:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:37,299 INFO L225 Difference]: With dead ends: 1033 [2025-03-08 05:25:37,299 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 05:25:37,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:37,302 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 53 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4183 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:37,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4183 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 05:25:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 538. [2025-03-08 05:25:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 421 states have (on average 1.6484560570071258) internal successors, (694), 440 states have internal predecessors, (694), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 877 transitions. [2025-03-08 05:25:37,325 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 877 transitions. Word has length 111 [2025-03-08 05:25:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:37,326 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 877 transitions. [2025-03-08 05:25:37,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 877 transitions. [2025-03-08 05:25:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:25:37,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:37,329 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-08 05:25:37,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:25:37,329 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:37,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1439731409, now seen corresponding path program 1 times [2025-03-08 05:25:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:37,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850025762] [2025-03-08 05:25:37,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:37,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:37,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:25:37,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:25:37,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:37,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850025762] [2025-03-08 05:25:37,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850025762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:37,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:37,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:37,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652384222] [2025-03-08 05:25:37,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:37,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:37,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:37,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:37,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:37,457 INFO L87 Difference]: Start difference. First operand 538 states and 877 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:25:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:37,517 INFO L93 Difference]: Finished difference Result 1024 states and 1686 transitions. [2025-03-08 05:25:37,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:25:37,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-03-08 05:25:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:37,522 INFO L225 Difference]: With dead ends: 1024 [2025-03-08 05:25:37,522 INFO L226 Difference]: Without dead ends: 517 [2025-03-08 05:25:37,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:37,524 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 84 mSDsluCounter, 4257 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5123 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:37,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5123 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-08 05:25:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-08 05:25:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 400 states have (on average 1.65) internal successors, (660), 419 states have internal predecessors, (660), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 843 transitions. [2025-03-08 05:25:37,538 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 843 transitions. Word has length 111 [2025-03-08 05:25:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:37,538 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 843 transitions. [2025-03-08 05:25:37,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:25:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 843 transitions. [2025-03-08 05:25:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:25:37,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:37,541 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-03-08 05:25:37,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:25:37,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:37,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash 878063240, now seen corresponding path program 1 times [2025-03-08 05:25:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710180561] [2025-03-08 05:25:37,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:37,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:25:37,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:25:37,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:37,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:37,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710180561] [2025-03-08 05:25:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710180561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:37,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:37,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:37,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62690867] [2025-03-08 05:25:37,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:37,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:37,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:37,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:37,661 INFO L87 Difference]: Start difference. First operand 517 states and 843 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:37,721 INFO L93 Difference]: Finished difference Result 1003 states and 1652 transitions. [2025-03-08 05:25:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:37,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-03-08 05:25:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:37,725 INFO L225 Difference]: With dead ends: 1003 [2025-03-08 05:25:37,725 INFO L226 Difference]: Without dead ends: 517 [2025-03-08 05:25:37,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:37,728 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 17 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4121 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:37,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4121 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-08 05:25:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-08 05:25:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 400 states have (on average 1.6475) internal successors, (659), 419 states have internal predecessors, (659), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 842 transitions. [2025-03-08 05:25:37,742 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 842 transitions. Word has length 112 [2025-03-08 05:25:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:37,743 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 842 transitions. [2025-03-08 05:25:37,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 842 transitions. [2025-03-08 05:25:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:25:37,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:37,745 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-03-08 05:25:37,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:25:37,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:37,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash 921522523, now seen corresponding path program 1 times [2025-03-08 05:25:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:37,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084810327] [2025-03-08 05:25:37,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:37,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:37,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:25:37,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:25:37,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:37,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:37,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:37,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084810327] [2025-03-08 05:25:37,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084810327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:37,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:37,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:37,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847599124] [2025-03-08 05:25:37,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:37,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:37,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:37,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:37,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:37,844 INFO L87 Difference]: Start difference. First operand 517 states and 842 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:37,901 INFO L93 Difference]: Finished difference Result 1003 states and 1651 transitions. [2025-03-08 05:25:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:37,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-03-08 05:25:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:37,906 INFO L225 Difference]: With dead ends: 1003 [2025-03-08 05:25:37,906 INFO L226 Difference]: Without dead ends: 517 [2025-03-08 05:25:37,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:37,908 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 16 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4121 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:37,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4121 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-08 05:25:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-08 05:25:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 400 states have (on average 1.645) internal successors, (658), 419 states have internal predecessors, (658), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 841 transitions. [2025-03-08 05:25:37,922 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 841 transitions. Word has length 113 [2025-03-08 05:25:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:37,923 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 841 transitions. [2025-03-08 05:25:37,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 841 transitions. [2025-03-08 05:25:37,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:25:37,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:37,925 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2025-03-08 05:25:37,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:25:37,926 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:37,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:37,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1600195653, now seen corresponding path program 1 times [2025-03-08 05:25:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:37,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507076705] [2025-03-08 05:25:37,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:37,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:37,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:25:37,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:25:37,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:37,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:25:38,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:38,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507076705] [2025-03-08 05:25:38,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507076705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:38,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:38,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:25:38,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207674340] [2025-03-08 05:25:38,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:38,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:25:38,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:38,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:25:38,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:38,116 INFO L87 Difference]: Start difference. First operand 517 states and 841 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:25:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:38,200 INFO L93 Difference]: Finished difference Result 997 states and 1639 transitions. [2025-03-08 05:25:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:38,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2025-03-08 05:25:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:38,204 INFO L225 Difference]: With dead ends: 997 [2025-03-08 05:25:38,204 INFO L226 Difference]: Without dead ends: 517 [2025-03-08 05:25:38,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:38,207 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 6 mSDsluCounter, 6578 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7403 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:38,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7403 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-08 05:25:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-08 05:25:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 400 states have (on average 1.6425) internal successors, (657), 419 states have internal predecessors, (657), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:25:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 840 transitions. [2025-03-08 05:25:38,220 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 840 transitions. Word has length 114 [2025-03-08 05:25:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:38,220 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 840 transitions. [2025-03-08 05:25:38,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:25:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 840 transitions. [2025-03-08 05:25:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:25:38,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:38,223 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-08 05:25:38,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:25:38,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:38,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:38,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1797237816, now seen corresponding path program 1 times [2025-03-08 05:25:38,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:38,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074630802] [2025-03-08 05:25:38,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:38,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:25:38,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:25:38,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:38,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:25:38,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:38,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074630802] [2025-03-08 05:25:38,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074630802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:38,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779971622] [2025-03-08 05:25:38,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:38,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:38,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:38,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:38,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:25:38,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:25:38,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:25:38,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:38,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:38,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:25:38,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:25:38,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:38,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779971622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:38,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:38,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:25:38,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640546870] [2025-03-08 05:25:38,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:38,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:25:38,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:38,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:25:38,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:38,700 INFO L87 Difference]: Start difference. First operand 517 states and 840 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:25:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:39,145 INFO L93 Difference]: Finished difference Result 997 states and 1661 transitions. [2025-03-08 05:25:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:39,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-03-08 05:25:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:39,149 INFO L225 Difference]: With dead ends: 997 [2025-03-08 05:25:39,149 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 05:25:39,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:39,152 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 796 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:39,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 2106 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:25:39,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 05:25:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-08 05:25:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 407 states have (on average 1.6437346437346438) internal successors, (669), 426 states have internal predecessors, (669), 94 states have call successors, (94), 24 states have call predecessors, (94), 23 states have return successors, (90), 87 states have call predecessors, (90), 89 states have call successors, (90) [2025-03-08 05:25:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 853 transitions. [2025-03-08 05:25:39,170 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 853 transitions. Word has length 115 [2025-03-08 05:25:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:39,171 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 853 transitions. [2025-03-08 05:25:39,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:25:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 853 transitions. [2025-03-08 05:25:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:25:39,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:39,173 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-08 05:25:39,183 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-08 05:25:39,376 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,SelfDestructingSolverStorable14 [2025-03-08 05:25:39,376 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:39,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:39,377 INFO L85 PathProgramCache]: Analyzing trace with hash 785722296, now seen corresponding path program 1 times [2025-03-08 05:25:39,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:39,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657848039] [2025-03-08 05:25:39,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:39,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:39,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:25:39,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:25:39,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:39,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:25:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657848039] [2025-03-08 05:25:39,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657848039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693389830] [2025-03-08 05:25:39,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:39,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:39,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:39,481 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:39,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:25:39,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:25:39,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:25:39,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:39,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:39,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:25:39,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:25:39,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:39,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693389830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:39,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:39,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:25:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015645549] [2025-03-08 05:25:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:39,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:25:39,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:39,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:25:39,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:39,852 INFO L87 Difference]: Start difference. First operand 525 states and 853 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:25:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:40,284 INFO L93 Difference]: Finished difference Result 1013 states and 1684 transitions. [2025-03-08 05:25:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:40,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2025-03-08 05:25:40,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:40,289 INFO L225 Difference]: With dead ends: 1013 [2025-03-08 05:25:40,289 INFO L226 Difference]: Without dead ends: 533 [2025-03-08 05:25:40,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:40,292 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 787 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:40,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 2103 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:25:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-08 05:25:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-03-08 05:25:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 414 states have (on average 1.644927536231884) internal successors, (681), 433 states have internal predecessors, (681), 94 states have call successors, (94), 25 states have call predecessors, (94), 24 states have return successors, (91), 87 states have call predecessors, (91), 89 states have call successors, (91) [2025-03-08 05:25:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 866 transitions. [2025-03-08 05:25:40,333 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 866 transitions. Word has length 117 [2025-03-08 05:25:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:40,335 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 866 transitions. [2025-03-08 05:25:40,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:25:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 866 transitions. [2025-03-08 05:25:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:25:40,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:40,337 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2025-03-08 05:25:40,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:25:40,537 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,SelfDestructingSolverStorable15 [2025-03-08 05:25:40,538 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:40,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1922450984, now seen corresponding path program 1 times [2025-03-08 05:25:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691922981] [2025-03-08 05:25:40,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:40,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:25:40,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:25:40,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:40,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:25:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:40,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691922981] [2025-03-08 05:25:40,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691922981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:40,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869686224] [2025-03-08 05:25:40,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:40,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:40,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:40,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:40,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:25:40,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:25:40,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:25:40,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:40,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:40,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:25:40,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:25:41,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869686224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:41,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:25:41,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034226821] [2025-03-08 05:25:41,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:41,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:25:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:41,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:25:41,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:41,031 INFO L87 Difference]: Start difference. First operand 533 states and 866 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:25:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:41,396 INFO L93 Difference]: Finished difference Result 1029 states and 1707 transitions. [2025-03-08 05:25:41,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:41,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2025-03-08 05:25:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:41,401 INFO L225 Difference]: With dead ends: 1029 [2025-03-08 05:25:41,401 INFO L226 Difference]: Without dead ends: 541 [2025-03-08 05:25:41,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:41,404 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 791 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:41,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 2100 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:25:41,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-08 05:25:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-03-08 05:25:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 421 states have (on average 1.6460807600950118) internal successors, (693), 440 states have internal predecessors, (693), 94 states have call successors, (94), 26 states have call predecessors, (94), 25 states have return successors, (92), 87 states have call predecessors, (92), 89 states have call successors, (92) [2025-03-08 05:25:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 879 transitions. [2025-03-08 05:25:41,420 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 879 transitions. Word has length 119 [2025-03-08 05:25:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:41,420 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 879 transitions. [2025-03-08 05:25:41,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:25:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 879 transitions. [2025-03-08 05:25:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:25:41,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:41,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2025-03-08 05:25:41,430 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-08 05:25:41,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:41,623 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:41,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2097277502, now seen corresponding path program 1 times [2025-03-08 05:25:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:41,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670215750] [2025-03-08 05:25:41,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:41,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:41,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:25:41,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:25:41,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:41,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:25:41,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670215750] [2025-03-08 05:25:41,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670215750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118645534] [2025-03-08 05:25:41,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:41,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:41,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:41,711 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:41,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:25:41,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:25:41,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:25:41,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:41,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:41,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1437 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:25:41,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:25:42,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:42,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118645534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:42,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:42,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:25:42,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723025861] [2025-03-08 05:25:42,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:42,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:25:42,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:42,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:25:42,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:42,038 INFO L87 Difference]: Start difference. First operand 541 states and 879 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:25:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:42,400 INFO L93 Difference]: Finished difference Result 1045 states and 1730 transitions. [2025-03-08 05:25:42,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:42,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2025-03-08 05:25:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:42,405 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 05:25:42,406 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 05:25:42,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:42,408 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 785 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:42,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 2097 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:25:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 05:25:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-03-08 05:25:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 428 states have (on average 1.647196261682243) internal successors, (705), 447 states have internal predecessors, (705), 94 states have call successors, (94), 27 states have call predecessors, (94), 26 states have return successors, (93), 87 states have call predecessors, (93), 89 states have call successors, (93) [2025-03-08 05:25:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 892 transitions. [2025-03-08 05:25:42,424 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 892 transitions. Word has length 121 [2025-03-08 05:25:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:42,424 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 892 transitions. [2025-03-08 05:25:42,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:25:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 892 transitions. [2025-03-08 05:25:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:25:42,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:42,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-03-08 05:25:42,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:25:42,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 05:25:42,628 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:42,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1961071112, now seen corresponding path program 1 times [2025-03-08 05:25:42,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:42,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841620538] [2025-03-08 05:25:42,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:42,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:25:42,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:25:42,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:42,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:25:42,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:42,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841620538] [2025-03-08 05:25:42,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841620538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:42,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912171835] [2025-03-08 05:25:42,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:42,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:42,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:42,839 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:42,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:25:42,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:25:43,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:25:43,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:43,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:43,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:25:43,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:25:43,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:43,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912171835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:43,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:43,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2025-03-08 05:25:43,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433339908] [2025-03-08 05:25:43,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:43,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:25:43,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:43,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:25:43,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:25:43,245 INFO L87 Difference]: Start difference. First operand 549 states and 892 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 05:25:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:43,516 INFO L93 Difference]: Finished difference Result 596 states and 962 transitions. [2025-03-08 05:25:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:43,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-03-08 05:25:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:43,523 INFO L225 Difference]: With dead ends: 596 [2025-03-08 05:25:43,523 INFO L226 Difference]: Without dead ends: 581 [2025-03-08 05:25:43,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:25:43,524 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 774 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:43,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1513 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:25:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-08 05:25:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 551. [2025-03-08 05:25:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 430 states have (on average 1.6441860465116278) internal successors, (707), 449 states have internal predecessors, (707), 94 states have call successors, (94), 27 states have call predecessors, (94), 26 states have return successors, (93), 87 states have call predecessors, (93), 89 states have call successors, (93) [2025-03-08 05:25:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 894 transitions. [2025-03-08 05:25:43,547 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 894 transitions. Word has length 123 [2025-03-08 05:25:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:43,548 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 894 transitions. [2025-03-08 05:25:43,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 05:25:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 894 transitions. [2025-03-08 05:25:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:25:43,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:43,551 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:43,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:25:43,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:43,752 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:43,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1041203526, now seen corresponding path program 1 times [2025-03-08 05:25:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:43,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158358429] [2025-03-08 05:25:43,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:43,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:25:43,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:25:43,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:43,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:25:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158358429] [2025-03-08 05:25:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158358429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601991884] [2025-03-08 05:25:43,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:43,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:43,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:43,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:43,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:25:44,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:25:44,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:25:44,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:44,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:44,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:25:44,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:25:44,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:44,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601991884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:44,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:44,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-08 05:25:44,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550871919] [2025-03-08 05:25:44,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:44,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:25:44,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:44,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:25:44,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:25:44,282 INFO L87 Difference]: Start difference. First operand 551 states and 894 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:25:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:44,306 INFO L93 Difference]: Finished difference Result 566 states and 912 transitions. [2025-03-08 05:25:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:44,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) Word has length 129 [2025-03-08 05:25:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:44,310 INFO L225 Difference]: With dead ends: 566 [2025-03-08 05:25:44,310 INFO L226 Difference]: Without dead ends: 551 [2025-03-08 05:25:44,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:25:44,312 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 0 mSDsluCounter, 2507 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3344 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:44,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3344 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-08 05:25:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-08 05:25:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 430 states have (on average 1.6418604651162791) internal successors, (706), 449 states have internal predecessors, (706), 94 states have call successors, (94), 27 states have call predecessors, (94), 26 states have return successors, (93), 87 states have call predecessors, (93), 89 states have call successors, (93) [2025-03-08 05:25:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 893 transitions. [2025-03-08 05:25:44,333 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 893 transitions. Word has length 129 [2025-03-08 05:25:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:44,333 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 893 transitions. [2025-03-08 05:25:44,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:25:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 893 transitions. [2025-03-08 05:25:44,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:25:44,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:44,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:44,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:25:44,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:44,541 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:44,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1164493993, now seen corresponding path program 1 times [2025-03-08 05:25:44,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:44,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356078271] [2025-03-08 05:25:44,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:44,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:44,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:25:44,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:25:44,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:44,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:25:44,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:44,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356078271] [2025-03-08 05:25:44,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356078271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:44,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638952314] [2025-03-08 05:25:44,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:44,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:44,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:44,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:44,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:25:44,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:25:45,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:25:45,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:45,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:45,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1491 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:25:45,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:25:45,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:45,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638952314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:45,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:45,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-03-08 05:25:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224546529] [2025-03-08 05:25:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:45,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:25:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:45,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:25:45,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:25:45,204 INFO L87 Difference]: Start difference. First operand 551 states and 893 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:25:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:47,669 INFO L93 Difference]: Finished difference Result 1896 states and 3142 transitions. [2025-03-08 05:25:47,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:25:47,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 139 [2025-03-08 05:25:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:47,678 INFO L225 Difference]: With dead ends: 1896 [2025-03-08 05:25:47,678 INFO L226 Difference]: Without dead ends: 1390 [2025-03-08 05:25:47,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:25:47,682 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 2321 mSDsluCounter, 2244 mSDsCounter, 0 mSdLazyCounter, 4605 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 5111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 4605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:47,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 2749 Invalid, 5111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 4605 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 05:25:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-08 05:25:47,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1277. [2025-03-08 05:25:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1002 states have (on average 1.6636726546906189) internal successors, (1667), 1041 states have internal predecessors, (1667), 210 states have call successors, (210), 59 states have call predecessors, (210), 64 states have return successors, (229), 202 states have call predecessors, (229), 205 states have call successors, (229) [2025-03-08 05:25:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 2106 transitions. [2025-03-08 05:25:47,762 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 2106 transitions. Word has length 139 [2025-03-08 05:25:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:47,763 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 2106 transitions. [2025-03-08 05:25:47,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:25:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 2106 transitions. [2025-03-08 05:25:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:25:47,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:47,767 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:47,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:25:47,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:47,968 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:47,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash 911807121, now seen corresponding path program 1 times [2025-03-08 05:25:47,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:47,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558356849] [2025-03-08 05:25:47,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:47,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:25:47,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:25:47,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:47,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:25:48,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:48,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558356849] [2025-03-08 05:25:48,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558356849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:48,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761962757] [2025-03-08 05:25:48,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:48,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:48,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:48,190 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:48,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:25:48,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:25:48,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:25:48,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:48,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:48,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:25:48,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:25:48,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761962757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:48,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-03-08 05:25:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426665654] [2025-03-08 05:25:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:48,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:48,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:25:48,536 INFO L87 Difference]: Start difference. First operand 1277 states and 2106 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:25:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:50,344 INFO L93 Difference]: Finished difference Result 2766 states and 4585 transitions. [2025-03-08 05:25:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:25:50,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 141 [2025-03-08 05:25:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:50,362 INFO L225 Difference]: With dead ends: 2766 [2025-03-08 05:25:50,362 INFO L226 Difference]: Without dead ends: 1534 [2025-03-08 05:25:50,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:25:50,368 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 2071 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 3282 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2153 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 3750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 3282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:50,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2153 Valid, 2024 Invalid, 3750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 3282 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 05:25:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-03-08 05:25:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1348. [2025-03-08 05:25:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1054 states have (on average 1.6499051233396584) internal successors, (1739), 1099 states have internal predecessors, (1739), 218 states have call successors, (218), 64 states have call predecessors, (218), 75 states have return successors, (255), 210 states have call predecessors, (255), 213 states have call successors, (255) [2025-03-08 05:25:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2212 transitions. [2025-03-08 05:25:50,456 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2212 transitions. Word has length 141 [2025-03-08 05:25:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:50,456 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2212 transitions. [2025-03-08 05:25:50,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:25:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2212 transitions. [2025-03-08 05:25:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:25:50,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:50,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:50,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:25:50,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 05:25:50,663 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:50,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2122226541, now seen corresponding path program 1 times [2025-03-08 05:25:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:50,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222889098] [2025-03-08 05:25:50,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:50,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:25:50,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:25:50,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:50,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:25:50,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:50,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222889098] [2025-03-08 05:25:50,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222889098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:50,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830555539] [2025-03-08 05:25:50,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:50,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:50,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:50,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:50,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:25:51,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:25:51,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:25:51,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:51,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:51,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:25:51,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:25:51,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830555539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:51,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-03-08 05:25:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903487342] [2025-03-08 05:25:51,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:51,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:25:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:51,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:25:51,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:25:51,154 INFO L87 Difference]: Start difference. First operand 1348 states and 2212 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:25:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:51,216 INFO L93 Difference]: Finished difference Result 3340 states and 5550 transitions. [2025-03-08 05:25:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:25:51,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-03-08 05:25:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:51,228 INFO L225 Difference]: With dead ends: 3340 [2025-03-08 05:25:51,228 INFO L226 Difference]: Without dead ends: 2040 [2025-03-08 05:25:51,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:25:51,233 INFO L435 NwaCegarLoop]: 1490 mSDtfsCounter, 780 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2319 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:51,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 2319 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2025-03-08 05:25:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1344. [2025-03-08 05:25:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1052 states have (on average 1.6492395437262357) internal successors, (1735), 1095 states have internal predecessors, (1735), 218 states have call successors, (218), 64 states have call predecessors, (218), 73 states have return successors, (246), 210 states have call predecessors, (246), 213 states have call successors, (246) [2025-03-08 05:25:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2199 transitions. [2025-03-08 05:25:51,301 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2199 transitions. Word has length 146 [2025-03-08 05:25:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:51,301 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 2199 transitions. [2025-03-08 05:25:51,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:25:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2199 transitions. [2025-03-08 05:25:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:25:51,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:51,305 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:51,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 05:25:51,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:51,509 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:51,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2048667508, now seen corresponding path program 1 times [2025-03-08 05:25:51,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:51,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064436262] [2025-03-08 05:25:51,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:51,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:51,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:25:51,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:25:51,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:51,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:25:51,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064436262] [2025-03-08 05:25:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064436262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424507304] [2025-03-08 05:25:51,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:51,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:51,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:51,720 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:51,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:25:51,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:25:51,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:25:51,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:51,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:51,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 1503 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:25:51,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:25:52,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:52,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424507304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:52,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:52,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:25:52,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114140009] [2025-03-08 05:25:52,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:52,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:52,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:52,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:25:52,013 INFO L87 Difference]: Start difference. First operand 1344 states and 2199 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:25:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:53,119 INFO L93 Difference]: Finished difference Result 4205 states and 7002 transitions. [2025-03-08 05:25:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:53,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 146 [2025-03-08 05:25:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:53,136 INFO L225 Difference]: With dead ends: 4205 [2025-03-08 05:25:53,137 INFO L226 Difference]: Without dead ends: 2906 [2025-03-08 05:25:53,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:25:53,143 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 1857 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:53,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 912 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:25:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2025-03-08 05:25:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2796. [2025-03-08 05:25:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2796 states, 2159 states have (on average 1.651690597498842) internal successors, (3566), 2255 states have internal predecessors, (3566), 487 states have call successors, (487), 123 states have call predecessors, (487), 149 states have return successors, (595), 479 states have call predecessors, (595), 482 states have call successors, (595) [2025-03-08 05:25:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 4648 transitions. [2025-03-08 05:25:53,251 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 4648 transitions. Word has length 146 [2025-03-08 05:25:53,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:53,252 INFO L471 AbstractCegarLoop]: Abstraction has 2796 states and 4648 transitions. [2025-03-08 05:25:53,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:25:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 4648 transitions. [2025-03-08 05:25:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 05:25:53,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:53,257 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:53,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 05:25:53,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 05:25:53,457 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:53,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash 915638768, now seen corresponding path program 1 times [2025-03-08 05:25:53,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:53,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901374556] [2025-03-08 05:25:53,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:53,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 05:25:53,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 05:25:53,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:53,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:25:53,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:53,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901374556] [2025-03-08 05:25:53,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901374556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:53,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427775743] [2025-03-08 05:25:53,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:53,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:53,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:53,669 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:53,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:25:53,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 05:25:53,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 05:25:53,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:53,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:53,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:25:53,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:25:53,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:53,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427775743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:53,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:53,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:25:53,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372071161] [2025-03-08 05:25:53,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:53,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:53,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:53,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:53,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:25:53,979 INFO L87 Difference]: Start difference. First operand 2796 states and 4648 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:25:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:55,153 INFO L93 Difference]: Finished difference Result 8986 states and 15253 transitions. [2025-03-08 05:25:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:55,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 147 [2025-03-08 05:25:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:55,190 INFO L225 Difference]: With dead ends: 8986 [2025-03-08 05:25:55,190 INFO L226 Difference]: Without dead ends: 6235 [2025-03-08 05:25:55,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:25:55,205 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1862 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:55,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 872 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:25:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6235 states. [2025-03-08 05:25:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6235 to 6000. [2025-03-08 05:25:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6000 states, 4552 states have (on average 1.6471880492091389) internal successors, (7498), 4776 states have internal predecessors, (7498), 1138 states have call successors, (1138), 241 states have call predecessors, (1138), 309 states have return successors, (1532), 1134 states have call predecessors, (1532), 1133 states have call successors, (1532) [2025-03-08 05:25:55,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6000 states to 6000 states and 10168 transitions. [2025-03-08 05:25:55,541 INFO L78 Accepts]: Start accepts. Automaton has 6000 states and 10168 transitions. Word has length 147 [2025-03-08 05:25:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:55,541 INFO L471 AbstractCegarLoop]: Abstraction has 6000 states and 10168 transitions. [2025-03-08 05:25:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:25:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6000 states and 10168 transitions. [2025-03-08 05:25:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 05:25:55,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:55,546 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:55,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 05:25:55,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 05:25:55,746 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:55,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1680150970, now seen corresponding path program 1 times [2025-03-08 05:25:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263155425] [2025-03-08 05:25:55,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:55,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:25:55,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:25:55,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:55,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:25:55,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263155425] [2025-03-08 05:25:55,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263155425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668035229] [2025-03-08 05:25:55,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:55,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:55,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:55,921 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:55,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 05:25:56,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:25:56,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:25:56,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:56,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:56,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1507 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:25:56,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:25:56,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668035229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:25:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009337416] [2025-03-08 05:25:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:56,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:56,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:56,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:25:56,223 INFO L87 Difference]: Start difference. First operand 6000 states and 10168 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:25:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:57,636 INFO L93 Difference]: Finished difference Result 19690 states and 34414 transitions. [2025-03-08 05:25:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:57,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2025-03-08 05:25:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:57,759 INFO L225 Difference]: With dead ends: 19690 [2025-03-08 05:25:57,759 INFO L226 Difference]: Without dead ends: 13735 [2025-03-08 05:25:57,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:25:57,850 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1847 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:57,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 869 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:25:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13735 states. [2025-03-08 05:25:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13735 to 13249. [2025-03-08 05:25:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13249 states, 9841 states have (on average 1.6380449141347424) internal successors, (16120), 10379 states have internal predecessors, (16120), 2758 states have call successors, (2758), 477 states have call predecessors, (2758), 649 states have return successors, (4182), 2774 states have call predecessors, (4182), 2753 states have call successors, (4182) [2025-03-08 05:25:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13249 states to 13249 states and 23060 transitions. [2025-03-08 05:25:58,733 INFO L78 Accepts]: Start accepts. Automaton has 13249 states and 23060 transitions. Word has length 148 [2025-03-08 05:25:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:58,734 INFO L471 AbstractCegarLoop]: Abstraction has 13249 states and 23060 transitions. [2025-03-08 05:25:58,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:25:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 13249 states and 23060 transitions. [2025-03-08 05:25:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:25:58,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:58,739 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:58,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 05:25:58,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 05:25:58,942 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:58,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash -545258006, now seen corresponding path program 1 times [2025-03-08 05:25:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:58,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387719181] [2025-03-08 05:25:58,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:58,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:58,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:25:58,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:25:58,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:58,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:25:59,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:59,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387719181] [2025-03-08 05:25:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387719181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:25:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460665638] [2025-03-08 05:25:59,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:59,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:25:59,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:59,166 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:25:59,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 05:25:59,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:25:59,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:25:59,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:59,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:59,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:25:59,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:25:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:25:59,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:25:59,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460665638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:59,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:25:59,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:25:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819061339] [2025-03-08 05:25:59,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:59,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:59,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:59,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:59,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:25:59,465 INFO L87 Difference]: Start difference. First operand 13249 states and 23060 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:26:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:01,609 INFO L93 Difference]: Finished difference Result 44247 states and 80977 transitions. [2025-03-08 05:26:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:01,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2025-03-08 05:26:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:01,875 INFO L225 Difference]: With dead ends: 44247 [2025-03-08 05:26:01,875 INFO L226 Difference]: Without dead ends: 31043 [2025-03-08 05:26:02,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:26:02,057 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 1835 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:02,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 863 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:26:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31043 states. [2025-03-08 05:26:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31043 to 30110. [2025-03-08 05:26:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30110 states, 21842 states have (on average 1.625583737752953) internal successors, (35506), 23162 states have internal predecessors, (35506), 6886 states have call successors, (6886), 949 states have call predecessors, (6886), 1381 states have return successors, (12056), 6978 states have call predecessors, (12056), 6881 states have call successors, (12056) [2025-03-08 05:26:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30110 states to 30110 states and 54448 transitions. [2025-03-08 05:26:04,080 INFO L78 Accepts]: Start accepts. Automaton has 30110 states and 54448 transitions. Word has length 149 [2025-03-08 05:26:04,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:04,081 INFO L471 AbstractCegarLoop]: Abstraction has 30110 states and 54448 transitions. [2025-03-08 05:26:04,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:26:04,081 INFO L276 IsEmpty]: Start isEmpty. Operand 30110 states and 54448 transitions. [2025-03-08 05:26:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 05:26:04,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:04,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:04,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 05:26:04,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 05:26:04,286 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:04,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash 276681728, now seen corresponding path program 1 times [2025-03-08 05:26:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161499152] [2025-03-08 05:26:04,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:04,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 05:26:04,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 05:26:04,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:04,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:26:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161499152] [2025-03-08 05:26:04,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161499152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:26:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839431199] [2025-03-08 05:26:04,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:04,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:04,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:04,484 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:26:04,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 05:26:04,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 05:26:04,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 05:26:04,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:04,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:04,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:26:04,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:26:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:26:04,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:26:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839431199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:04,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:26:04,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:26:04,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959948536] [2025-03-08 05:26:04,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:04,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:04,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:04,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:04,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:26:04,773 INFO L87 Difference]: Start difference. First operand 30110 states and 54448 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:26:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:10,196 INFO L93 Difference]: Finished difference Result 102043 states and 200853 transitions. [2025-03-08 05:26:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:10,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 150 [2025-03-08 05:26:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:10,883 INFO L225 Difference]: With dead ends: 102043 [2025-03-08 05:26:10,883 INFO L226 Difference]: Without dead ends: 71968 [2025-03-08 05:26:11,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:26:11,287 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1809 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:11,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1881 Valid, 961 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:26:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71968 states. [2025-03-08 05:26:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71968 to 70389. [2025-03-08 05:26:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70389 states, 49805 states have (on average 1.6109225981327175) internal successors, (80232), 53099 states have internal predecessors, (80232), 17602 states have call successors, (17602), 1890 states have call predecessors, (17602), 2981 states have return successors, (36665), 17953 states have call predecessors, (36665), 17597 states have call successors, (36665) [2025-03-08 05:26:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70389 states to 70389 states and 134499 transitions. [2025-03-08 05:26:16,314 INFO L78 Accepts]: Start accepts. Automaton has 70389 states and 134499 transitions. Word has length 150 [2025-03-08 05:26:16,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:16,315 INFO L471 AbstractCegarLoop]: Abstraction has 70389 states and 134499 transitions. [2025-03-08 05:26:16,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:26:16,315 INFO L276 IsEmpty]: Start isEmpty. Operand 70389 states and 134499 transitions. [2025-03-08 05:26:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 05:26:16,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:16,340 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:16,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 05:26:16,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:16,540 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:16,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:16,541 INFO L85 PathProgramCache]: Analyzing trace with hash -882928728, now seen corresponding path program 1 times [2025-03-08 05:26:16,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:16,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616052121] [2025-03-08 05:26:16,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:16,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:16,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 05:26:16,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 05:26:16,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:16,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 05:26:16,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:16,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616052121] [2025-03-08 05:26:16,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616052121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:26:16,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404981434] [2025-03-08 05:26:16,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:16,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:16,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:16,841 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:26:16,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 05:26:16,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 05:26:17,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 05:26:17,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:17,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:17,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1894 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:26:17,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:26:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:26:17,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:26:17,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404981434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:17,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:26:17,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:26:17,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832001419] [2025-03-08 05:26:17,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:17,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:17,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:17,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:26:17,151 INFO L87 Difference]: Start difference. First operand 70389 states and 134499 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:26:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:22,126 INFO L93 Difference]: Finished difference Result 143612 states and 284272 transitions. [2025-03-08 05:26:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 198 [2025-03-08 05:26:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:22,814 INFO L225 Difference]: With dead ends: 143612 [2025-03-08 05:26:22,814 INFO L226 Difference]: Without dead ends: 73269 [2025-03-08 05:26:23,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:26:23,239 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 144 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:23,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2311 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73269 states. [2025-03-08 05:26:26,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73269 to 72885. [2025-03-08 05:26:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72885 states, 52237 states have (on average 1.6253613339204012) internal successors, (84904), 55531 states have internal predecessors, (84904), 17602 states have call successors, (17602), 1954 states have call predecessors, (17602), 3045 states have return successors, (36665), 17953 states have call predecessors, (36665), 17597 states have call successors, (36665) [2025-03-08 05:26:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72885 states to 72885 states and 139171 transitions. [2025-03-08 05:26:27,778 INFO L78 Accepts]: Start accepts. Automaton has 72885 states and 139171 transitions. Word has length 198 [2025-03-08 05:26:27,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:27,778 INFO L471 AbstractCegarLoop]: Abstraction has 72885 states and 139171 transitions. [2025-03-08 05:26:27,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:26:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 72885 states and 139171 transitions. [2025-03-08 05:26:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 05:26:27,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:27,801 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:27,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 05:26:28,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 05:26:28,002 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:28,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:28,002 INFO L85 PathProgramCache]: Analyzing trace with hash 121782607, now seen corresponding path program 1 times [2025-03-08 05:26:28,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:28,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124095433] [2025-03-08 05:26:28,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:28,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 05:26:28,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 05:26:28,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:28,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 05:26:28,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124095433] [2025-03-08 05:26:28,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124095433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:26:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565513181] [2025-03-08 05:26:28,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:28,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:28,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:28,525 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:26:28,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 05:26:28,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 05:26:28,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 05:26:28,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:28,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:28,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 1899 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:26:28,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:26:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 05:26:28,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:26:28,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565513181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:28,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:26:28,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:26:28,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217364386] [2025-03-08 05:26:28,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:28,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:28,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:28,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:28,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:26:28,806 INFO L87 Difference]: Start difference. First operand 72885 states and 139171 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:26:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:33,843 INFO L93 Difference]: Finished difference Result 148604 states and 293808 transitions. [2025-03-08 05:26:33,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:33,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 203 [2025-03-08 05:26:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:34,497 INFO L225 Difference]: With dead ends: 148604 [2025-03-08 05:26:34,497 INFO L226 Difference]: Without dead ends: 75765 [2025-03-08 05:26:35,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:26:35,244 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 139 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:35,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2316 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75765 states. [2025-03-08 05:26:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75765 to 75381. [2025-03-08 05:26:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75381 states, 54605 states have (on average 1.6392638036809817) internal successors, (89512), 57899 states have internal predecessors, (89512), 17666 states have call successors, (17666), 2018 states have call predecessors, (17666), 3109 states have return successors, (36729), 18017 states have call predecessors, (36729), 17661 states have call successors, (36729) [2025-03-08 05:26:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75381 states to 75381 states and 143907 transitions. [2025-03-08 05:26:39,908 INFO L78 Accepts]: Start accepts. Automaton has 75381 states and 143907 transitions. Word has length 203 [2025-03-08 05:26:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:39,908 INFO L471 AbstractCegarLoop]: Abstraction has 75381 states and 143907 transitions. [2025-03-08 05:26:39,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:26:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 75381 states and 143907 transitions. [2025-03-08 05:26:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 05:26:39,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:39,925 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:39,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 05:26:40,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:40,125 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:40,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:40,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1763393356, now seen corresponding path program 1 times [2025-03-08 05:26:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:40,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734816349] [2025-03-08 05:26:40,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:40,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 05:26:40,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 05:26:40,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:40,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 05:26:40,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:40,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734816349] [2025-03-08 05:26:40,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734816349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:26:40,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370447116] [2025-03-08 05:26:40,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:40,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:40,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:40,308 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:26:40,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 05:26:40,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 05:26:40,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 05:26:40,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:40,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:40,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 1900 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:26:40,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:26:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 05:26:40,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:26:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370447116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:40,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:26:40,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:26:40,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916684423] [2025-03-08 05:26:40,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:40,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:40,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:40,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:26:40,580 INFO L87 Difference]: Start difference. First operand 75381 states and 143907 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:26:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:46,413 INFO L93 Difference]: Finished difference Result 153788 states and 302992 transitions. [2025-03-08 05:26:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:46,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 204 [2025-03-08 05:26:46,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:47,107 INFO L225 Difference]: With dead ends: 153788 [2025-03-08 05:26:47,107 INFO L226 Difference]: Without dead ends: 78453 [2025-03-08 05:26:47,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:26:47,585 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 142 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:47,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2308 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78453 states. [2025-03-08 05:26:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78453 to 77877. [2025-03-08 05:26:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77877 states, 57037 states have (on average 1.6512789943370094) internal successors, (94184), 60331 states have internal predecessors, (94184), 17666 states have call successors, (17666), 2082 states have call predecessors, (17666), 3173 states have return successors, (36729), 18017 states have call predecessors, (36729), 17661 states have call successors, (36729) [2025-03-08 05:26:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77877 states to 77877 states and 148579 transitions. [2025-03-08 05:26:52,018 INFO L78 Accepts]: Start accepts. Automaton has 77877 states and 148579 transitions. Word has length 204 [2025-03-08 05:26:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:52,019 INFO L471 AbstractCegarLoop]: Abstraction has 77877 states and 148579 transitions. [2025-03-08 05:26:52,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:26:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 77877 states and 148579 transitions. [2025-03-08 05:26:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-08 05:26:52,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:52,037 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:52,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0