./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product10.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/email_spec0_product10.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 ac360da941eb2bc713d1cdb41b6939d6a50ea394a41fda87a7330709a6b33058 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:29:13,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:29:13,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:29:13,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:29:13,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:29:13,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:29:13,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:29:13,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:29:13,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:29:13,216 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:29:13,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:29:13,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:29:13,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:29:13,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:29:13,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:29:13,218 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:29:13,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:13,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:29:13,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:29:13,219 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 -> ac360da941eb2bc713d1cdb41b6939d6a50ea394a41fda87a7330709a6b33058 [2025-03-08 05:29:13,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:29:13,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:29:13,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:29:13,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:29:13,465 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:29:13,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product10.cil.c [2025-03-08 05:29:14,595 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b54b3065/c0cf9040aa3f44f88ff610669033e2ba/FLAGc6e0d8786 [2025-03-08 05:29:14,888 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:29:14,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product10.cil.c [2025-03-08 05:29:14,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b54b3065/c0cf9040aa3f44f88ff610669033e2ba/FLAGc6e0d8786 [2025-03-08 05:29:15,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b54b3065/c0cf9040aa3f44f88ff610669033e2ba [2025-03-08 05:29:15,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:29:15,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:29:15,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:15,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:29:15,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:29:15,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374b78d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15, skipping insertion in model container [2025-03-08 05:29:15,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:29:15,332 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/email_spec0_product10.cil.c[2842,2855] [2025-03-08 05:29:15,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:15,552 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:29:15,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-03-08 05:29:15,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [66] [2025-03-08 05:29:15,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [115] [2025-03-08 05:29:15,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [124] [2025-03-08 05:29:15,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [145] [2025-03-08 05:29:15,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [511] [2025-03-08 05:29:15,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [714] [2025-03-08 05:29:15,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [859] [2025-03-08 05:29:15,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1267] [2025-03-08 05:29:15,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1462] [2025-03-08 05:29:15,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1525] [2025-03-08 05:29:15,564 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/email_spec0_product10.cil.c[2842,2855] [2025-03-08 05:29:15,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:15,649 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:29:15,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15 WrapperNode [2025-03-08 05:29:15,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:15,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:15,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:29:15,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:29:15,656 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:29:15" (1/1) ... [2025-03-08 05:29:15,670 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:29:15" (1/1) ... [2025-03-08 05:29:15,693 INFO L138 Inliner]: procedures = 110, calls = 121, calls flagged for inlining = 40, calls inlined = 33, statements flattened = 619 [2025-03-08 05:29:15,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:15,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:29:15,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:29:15,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:29:15,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,717 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2025-03-08 05:29:15,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:29:15,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:29:15,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:29:15,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:29:15,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (1/1) ... [2025-03-08 05:29:15,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:15,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:15,759 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:29:15,763 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:29:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:29:15,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:29:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:29:15,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:29:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:29:15,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:29:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:29:15,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:29:15,780 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:29:15,780 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:29:15,780 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:29:15,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:29:15,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:29:15,781 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:29:15,781 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:29:15,781 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:29:15,781 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:29:15,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:29:15,781 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:29:15,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:29:15,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:29:15,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:29:15,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:29:15,903 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:29:15,905 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:29:16,031 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2575-1: getClientId_#res#1 := getClientId_~retValue_acc~41#1; [2025-03-08 05:29:16,032 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L911-1: getEmailId_#res#1 := getEmailId_~retValue_acc~12#1; [2025-03-08 05:29:16,032 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2093-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~33#1; [2025-03-08 05:29:16,032 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~40#1; [2025-03-08 05:29:16,043 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L985: #res := ~retValue_acc~14; [2025-03-08 05:29:16,056 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1522-1: createEmail_#res#1 := createEmail_~retValue_acc~24#1; [2025-03-08 05:29:16,225 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L664-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~7#1; [2025-03-08 05:29:16,225 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L673-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~8#1; [2025-03-08 05:29:16,225 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2025-03-08 05:29:16,225 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L682-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~9#1; [2025-03-08 05:29:16,230 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L948: #res := ~retValue_acc~13; [2025-03-08 05:29:16,232 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498: #res := ~retValue_acc~22; [2025-03-08 05:29:16,276 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2025-03-08 05:29:16,276 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:29:16,283 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:29:16,284 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:29:16,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:16 BoogieIcfgContainer [2025-03-08 05:29:16,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:29:16,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:29:16,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:29:16,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:29:16,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:15" (1/3) ... [2025-03-08 05:29:16,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd3fcc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:16, skipping insertion in model container [2025-03-08 05:29:16,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:15" (2/3) ... [2025-03-08 05:29:16,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd3fcc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:16, skipping insertion in model container [2025-03-08 05:29:16,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:16" (3/3) ... [2025-03-08 05:29:16,290 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product10.cil.c [2025-03-08 05:29:16,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:29:16,316 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product10.cil.c that has 10 procedures, 152 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:29:16,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:29:16,379 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;@44212a2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:29:16,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:29:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 122 states have (on average 1.4754098360655739) internal successors, (180), 124 states have internal predecessors, (180), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 05:29:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:29:16,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:16,393 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 05:29:16,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:16,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:16,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1054711938, now seen corresponding path program 1 times [2025-03-08 05:29:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223244957] [2025-03-08 05:29:16,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:16,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:16,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:29:16,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:29:16,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:16,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:29:16,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:16,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223244957] [2025-03-08 05:29:16,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223244957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:16,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431750797] [2025-03-08 05:29:16,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:16,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:16,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:16,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:16,863 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:29:16,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:29:17,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:29:17,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:17,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:29:17,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:29:17,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:17,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431750797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:17,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:17,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:29:17,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516420456] [2025-03-08 05:29:17,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:17,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:17,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:17,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:17,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:17,140 INFO L87 Difference]: Start difference. First operand has 152 states, 122 states have (on average 1.4754098360655739) internal successors, (180), 124 states have internal predecessors, (180), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:17,173 INFO L93 Difference]: Finished difference Result 252 states and 353 transitions. [2025-03-08 05:29:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:17,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-03-08 05:29:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:17,179 INFO L225 Difference]: With dead ends: 252 [2025-03-08 05:29:17,179 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 05:29:17,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:17,183 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:17,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 05:29:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-08 05:29:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.4615384615384615) internal successors, (171), 118 states have internal predecessors, (171), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 05:29:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2025-03-08 05:29:17,215 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 208 transitions. Word has length 79 [2025-03-08 05:29:17,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:17,216 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 208 transitions. [2025-03-08 05:29:17,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 208 transitions. [2025-03-08 05:29:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:29:17,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:17,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 05:29:17,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:29:17,421 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,SelfDestructingSolverStorable0 [2025-03-08 05:29:17,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash -438168995, now seen corresponding path program 1 times [2025-03-08 05:29:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111357100] [2025-03-08 05:29:17,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:17,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:29:17,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:29:17,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:17,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:29:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:17,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111357100] [2025-03-08 05:29:17,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111357100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:17,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545259310] [2025-03-08 05:29:17,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:17,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:17,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:17,579 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:29:17,581 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:29:17,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:29:17,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:29:17,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:17,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:17,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:29:17,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:29:17,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:17,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545259310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:17,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:17,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:29:17,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019704036] [2025-03-08 05:29:17,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:17,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:17,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:17,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:17,825 INFO L87 Difference]: Start difference. First operand 146 states and 208 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:29:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:17,879 INFO L93 Difference]: Finished difference Result 285 states and 409 transitions. [2025-03-08 05:29:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 82 [2025-03-08 05:29:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:17,885 INFO L225 Difference]: With dead ends: 285 [2025-03-08 05:29:17,885 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 05:29:17,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:17,886 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 2 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:17,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 785 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 05:29:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-08 05:29:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 120 states have internal predecessors, (172), 19 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2025-03-08 05:29:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 211 transitions. [2025-03-08 05:29:17,906 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 211 transitions. Word has length 82 [2025-03-08 05:29:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:17,907 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 211 transitions. [2025-03-08 05:29:17,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:29:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 211 transitions. [2025-03-08 05:29:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:29:17,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:17,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:17,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:18,109 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,SelfDestructingSolverStorable1 [2025-03-08 05:29:18,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:18,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash 557844143, now seen corresponding path program 1 times [2025-03-08 05:29:18,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:18,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538459618] [2025-03-08 05:29:18,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:18,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:18,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:29:18,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:29:18,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:18,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:29:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538459618] [2025-03-08 05:29:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538459618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:18,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906746905] [2025-03-08 05:29:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:18,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:18,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:18,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:18,264 INFO L87 Difference]: Start difference. First operand 148 states and 211 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:29:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:18,303 INFO L93 Difference]: Finished difference Result 277 states and 397 transitions. [2025-03-08 05:29:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:18,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2025-03-08 05:29:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:18,305 INFO L225 Difference]: With dead ends: 277 [2025-03-08 05:29:18,305 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 05:29:18,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:18,310 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 2 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 789 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:29:18,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 789 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 05:29:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-08 05:29:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 120 states have internal predecessors, (172), 19 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2025-03-08 05:29:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 210 transitions. [2025-03-08 05:29:18,323 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 210 transitions. Word has length 83 [2025-03-08 05:29:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:18,324 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 210 transitions. [2025-03-08 05:29:18,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:29:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 210 transitions. [2025-03-08 05:29:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:29:18,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:18,327 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:18,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:29:18,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:18,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:18,328 INFO L85 PathProgramCache]: Analyzing trace with hash -486836345, now seen corresponding path program 2 times [2025-03-08 05:29:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:18,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413065367] [2025-03-08 05:29:18,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:29:18,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:18,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-08 05:29:18,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 52 of 84 statements. [2025-03-08 05:29:18,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:29:18,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:29:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:18,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413065367] [2025-03-08 05:29:18,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413065367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:18,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:18,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117597632] [2025-03-08 05:29:18,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:18,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:18,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:18,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:18,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:18,443 INFO L87 Difference]: Start difference. First operand 148 states and 210 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:18,490 INFO L93 Difference]: Finished difference Result 363 states and 512 transitions. [2025-03-08 05:29:18,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:18,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-08 05:29:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:18,492 INFO L225 Difference]: With dead ends: 363 [2025-03-08 05:29:18,492 INFO L226 Difference]: Without dead ends: 278 [2025-03-08 05:29:18,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:18,492 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 170 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:18,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 792 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-08 05:29:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2025-03-08 05:29:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 222 states have (on average 1.472972972972973) internal successors, (327), 225 states have internal predecessors, (327), 35 states have call successors, (35), 17 states have call predecessors, (35), 18 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 05:29:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 396 transitions. [2025-03-08 05:29:18,516 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 396 transitions. Word has length 84 [2025-03-08 05:29:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:18,516 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 396 transitions. [2025-03-08 05:29:18,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 396 transitions. [2025-03-08 05:29:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:29:18,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:18,520 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:18,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:29:18,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:18,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash -262801442, now seen corresponding path program 1 times [2025-03-08 05:29:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570453196] [2025-03-08 05:29:18,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:18,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:29:18,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:29:18,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:18,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:29:18,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570453196] [2025-03-08 05:29:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570453196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:18,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:18,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:18,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119366228] [2025-03-08 05:29:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:18,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:18,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:18,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:18,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:18,651 INFO L87 Difference]: Start difference. First operand 276 states and 396 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:29:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:18,692 INFO L93 Difference]: Finished difference Result 535 states and 772 transitions. [2025-03-08 05:29:18,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:18,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 85 [2025-03-08 05:29:18,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:18,695 INFO L225 Difference]: With dead ends: 535 [2025-03-08 05:29:18,695 INFO L226 Difference]: Without dead ends: 278 [2025-03-08 05:29:18,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:18,696 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:18,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 792 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-08 05:29:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-03-08 05:29:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 223 states have (on average 1.4708520179372198) internal successors, (328), 227 states have internal predecessors, (328), 35 states have call successors, (35), 17 states have call predecessors, (35), 19 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2025-03-08 05:29:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 399 transitions. [2025-03-08 05:29:18,713 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 399 transitions. Word has length 85 [2025-03-08 05:29:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:18,713 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 399 transitions. [2025-03-08 05:29:18,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:29:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 399 transitions. [2025-03-08 05:29:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:29:18,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:18,716 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:18,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:29:18,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:18,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:18,717 INFO L85 PathProgramCache]: Analyzing trace with hash 667291449, now seen corresponding path program 1 times [2025-03-08 05:29:18,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:18,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869330101] [2025-03-08 05:29:18,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:18,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:18,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:29:18,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:29:18,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:18,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:18,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869330101] [2025-03-08 05:29:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869330101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236670049] [2025-03-08 05:29:18,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:18,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:18,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:18,830 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:29:18,832 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:29:18,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:29:19,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:29:19,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:19,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:19,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:19,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:19,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:29:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:19,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236670049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:29:19,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:29:19,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:29:19,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766265264] [2025-03-08 05:29:19,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:29:19,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:29:19,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:19,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:29:19,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:19,125 INFO L87 Difference]: Start difference. First operand 278 states and 399 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:29:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:19,153 INFO L93 Difference]: Finished difference Result 674 states and 1003 transitions. [2025-03-08 05:29:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:19,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 86 [2025-03-08 05:29:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:19,157 INFO L225 Difference]: With dead ends: 674 [2025-03-08 05:29:19,158 INFO L226 Difference]: Without dead ends: 486 [2025-03-08 05:29:19,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:19,159 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 194 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:19,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1033 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-08 05:29:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 446. [2025-03-08 05:29:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 391 states have (on average 1.6265984654731458) internal successors, (636), 395 states have internal predecessors, (636), 35 states have call successors, (35), 17 states have call predecessors, (35), 19 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2025-03-08 05:29:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 707 transitions. [2025-03-08 05:29:19,186 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 707 transitions. Word has length 86 [2025-03-08 05:29:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:19,187 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 707 transitions. [2025-03-08 05:29:19,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:29:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 707 transitions. [2025-03-08 05:29:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:29:19,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:19,189 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:19,196 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:29:19,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:19,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:19,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1573740909, now seen corresponding path program 1 times [2025-03-08 05:29:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:19,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024647052] [2025-03-08 05:29:19,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:19,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:29:19,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:29:19,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:19,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024647052] [2025-03-08 05:29:19,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024647052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:19,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730557117] [2025-03-08 05:29:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:19,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:19,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:19,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:19,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:19,444 INFO L87 Difference]: Start difference. First operand 446 states and 707 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:19,464 INFO L93 Difference]: Finished difference Result 1046 states and 1699 transitions. [2025-03-08 05:29:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:19,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2025-03-08 05:29:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:19,469 INFO L225 Difference]: With dead ends: 1046 [2025-03-08 05:29:19,469 INFO L226 Difference]: Without dead ends: 626 [2025-03-08 05:29:19,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:19,472 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 65 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:19,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 420 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-08 05:29:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 610. [2025-03-08 05:29:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 555 states have (on average 1.6756756756756757) internal successors, (930), 559 states have internal predecessors, (930), 35 states have call successors, (35), 17 states have call predecessors, (35), 19 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2025-03-08 05:29:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1001 transitions. [2025-03-08 05:29:19,500 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1001 transitions. Word has length 94 [2025-03-08 05:29:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:19,500 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 1001 transitions. [2025-03-08 05:29:19,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1001 transitions. [2025-03-08 05:29:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:29:19,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:19,502 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2025-03-08 05:29:19,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:29:19,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:19,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1578395446, now seen corresponding path program 2 times [2025-03-08 05:29:19,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:19,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895222645] [2025-03-08 05:29:19,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:29:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:19,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-08 05:29:19,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 95 statements. [2025-03-08 05:29:19,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:29:19,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:29:19,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895222645] [2025-03-08 05:29:19,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895222645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:19,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164481208] [2025-03-08 05:29:19,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:19,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:19,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:19,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:19,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:19,594 INFO L87 Difference]: Start difference. First operand 610 states and 1001 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:19,667 INFO L93 Difference]: Finished difference Result 812 states and 1268 transitions. [2025-03-08 05:29:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-03-08 05:29:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:19,670 INFO L225 Difference]: With dead ends: 812 [2025-03-08 05:29:19,670 INFO L226 Difference]: Without dead ends: 640 [2025-03-08 05:29:19,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:29:19,672 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 22 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:19,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 972 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-08 05:29:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 628. [2025-03-08 05:29:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 567 states have (on average 1.6649029982363315) internal successors, (944), 571 states have internal predecessors, (944), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1027 transitions. [2025-03-08 05:29:19,701 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1027 transitions. Word has length 95 [2025-03-08 05:29:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:19,703 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 1027 transitions. [2025-03-08 05:29:19,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1027 transitions. [2025-03-08 05:29:19,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 05:29:19,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:19,706 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2025-03-08 05:29:19,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:29:19,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:19,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:19,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1644429230, now seen corresponding path program 1 times [2025-03-08 05:29:19,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:19,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292060706] [2025-03-08 05:29:19,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:19,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:19,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:29:19,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:29:19,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:19,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:29:19,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:19,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292060706] [2025-03-08 05:29:19,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292060706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:19,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:19,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:19,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33499677] [2025-03-08 05:29:19,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:19,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:19,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:19,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:19,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:19,814 INFO L87 Difference]: Start difference. First operand 628 states and 1027 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:19,846 INFO L93 Difference]: Finished difference Result 1117 states and 1803 transitions. [2025-03-08 05:29:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:19,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2025-03-08 05:29:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:19,851 INFO L225 Difference]: With dead ends: 1117 [2025-03-08 05:29:19,851 INFO L226 Difference]: Without dead ends: 644 [2025-03-08 05:29:19,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:19,855 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 64 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:19,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1011 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-08 05:29:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 628. [2025-03-08 05:29:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 567 states have (on average 1.656084656084656) internal successors, (939), 571 states have internal predecessors, (939), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1022 transitions. [2025-03-08 05:29:19,881 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1022 transitions. Word has length 96 [2025-03-08 05:29:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:19,882 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 1022 transitions. [2025-03-08 05:29:19,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1022 transitions. [2025-03-08 05:29:19,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 05:29:19,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:19,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:19,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:29:19,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:19,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:19,885 INFO L85 PathProgramCache]: Analyzing trace with hash -162439081, now seen corresponding path program 1 times [2025-03-08 05:29:19,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:19,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085939632] [2025-03-08 05:29:19,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:19,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:19,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:29:19,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:29:19,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:19,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:19,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:19,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085939632] [2025-03-08 05:29:19,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085939632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:19,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:19,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:19,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36660423] [2025-03-08 05:29:19,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:19,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:19,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:19,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:19,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:19,940 INFO L87 Difference]: Start difference. First operand 628 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:19,965 INFO L93 Difference]: Finished difference Result 1451 states and 2409 transitions. [2025-03-08 05:29:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:19,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2025-03-08 05:29:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:19,970 INFO L225 Difference]: With dead ends: 1451 [2025-03-08 05:29:19,970 INFO L226 Difference]: Without dead ends: 865 [2025-03-08 05:29:19,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:19,971 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 63 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:19,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 401 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-08 05:29:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 849. [2025-03-08 05:29:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 788 states have (on average 1.6916243654822336) internal successors, (1333), 792 states have internal predecessors, (1333), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1416 transitions. [2025-03-08 05:29:20,004 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1416 transitions. Word has length 96 [2025-03-08 05:29:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:20,004 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1416 transitions. [2025-03-08 05:29:20,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1416 transitions. [2025-03-08 05:29:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:29:20,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:20,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:20,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:29:20,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:20,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash 488067162, now seen corresponding path program 1 times [2025-03-08 05:29:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:20,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910351880] [2025-03-08 05:29:20,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:20,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:29:20,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:29:20,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:20,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:20,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:20,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910351880] [2025-03-08 05:29:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910351880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:20,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:20,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186934319] [2025-03-08 05:29:20,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:20,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:20,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:20,058 INFO L87 Difference]: Start difference. First operand 849 states and 1416 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:20,082 INFO L93 Difference]: Finished difference Result 2051 states and 3474 transitions. [2025-03-08 05:29:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:20,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2025-03-08 05:29:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:20,087 INFO L225 Difference]: With dead ends: 2051 [2025-03-08 05:29:20,087 INFO L226 Difference]: Without dead ends: 1259 [2025-03-08 05:29:20,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:20,089 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 61 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:20,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 409 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-03-08 05:29:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1243. [2025-03-08 05:29:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1182 states have (on average 1.7089678510998307) internal successors, (2020), 1186 states have internal predecessors, (2020), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2103 transitions. [2025-03-08 05:29:20,119 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 2103 transitions. Word has length 97 [2025-03-08 05:29:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:20,119 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 2103 transitions. [2025-03-08 05:29:20,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2103 transitions. [2025-03-08 05:29:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:29:20,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:20,122 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:20,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:29:20,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:20,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash -833865096, now seen corresponding path program 1 times [2025-03-08 05:29:20,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444276061] [2025-03-08 05:29:20,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:20,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:29:20,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:29:20,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:20,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:20,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:20,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444276061] [2025-03-08 05:29:20,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444276061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:20,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:20,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977708666] [2025-03-08 05:29:20,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:20,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:20,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:20,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:20,164 INFO L87 Difference]: Start difference. First operand 1243 states and 2103 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:20,195 INFO L93 Difference]: Finished difference Result 3055 states and 5235 transitions. [2025-03-08 05:29:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:20,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-03-08 05:29:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:20,202 INFO L225 Difference]: With dead ends: 3055 [2025-03-08 05:29:20,203 INFO L226 Difference]: Without dead ends: 1910 [2025-03-08 05:29:20,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:20,205 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 59 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:20,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 408 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2025-03-08 05:29:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1894. [2025-03-08 05:29:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1833 states have (on average 1.7163120567375887) internal successors, (3146), 1837 states have internal predecessors, (3146), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3229 transitions. [2025-03-08 05:29:20,258 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3229 transitions. Word has length 98 [2025-03-08 05:29:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:20,258 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3229 transitions. [2025-03-08 05:29:20,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3229 transitions. [2025-03-08 05:29:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:29:20,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:20,262 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:20,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:29:20,262 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:20,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash -610976903, now seen corresponding path program 1 times [2025-03-08 05:29:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:20,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824416204] [2025-03-08 05:29:20,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:20,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:29:20,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:29:20,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:20,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:20,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:20,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824416204] [2025-03-08 05:29:20,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824416204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:20,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:20,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:20,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971019397] [2025-03-08 05:29:20,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:20,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:20,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:20,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:20,303 INFO L87 Difference]: Start difference. First operand 1894 states and 3229 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:20,348 INFO L93 Difference]: Finished difference Result 4758 states and 8202 transitions. [2025-03-08 05:29:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:20,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2025-03-08 05:29:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:20,359 INFO L225 Difference]: With dead ends: 4758 [2025-03-08 05:29:20,359 INFO L226 Difference]: Without dead ends: 3031 [2025-03-08 05:29:20,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:20,363 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 57 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:20,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 408 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2025-03-08 05:29:20,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 3015. [2025-03-08 05:29:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3015 states, 2954 states have (on average 1.7173324306025728) internal successors, (5073), 2958 states have internal predecessors, (5073), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 5156 transitions. [2025-03-08 05:29:20,443 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 5156 transitions. Word has length 99 [2025-03-08 05:29:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:20,443 INFO L471 AbstractCegarLoop]: Abstraction has 3015 states and 5156 transitions. [2025-03-08 05:29:20,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 5156 transitions. [2025-03-08 05:29:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 05:29:20,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:20,449 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:20,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:29:20,450 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:20,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2037586407, now seen corresponding path program 1 times [2025-03-08 05:29:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544470782] [2025-03-08 05:29:20,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:20,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 05:29:20,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:29:20,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:20,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:20,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:20,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544470782] [2025-03-08 05:29:20,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544470782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:20,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:20,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:20,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045188826] [2025-03-08 05:29:20,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:20,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:20,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:20,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:20,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:20,516 INFO L87 Difference]: Start difference. First operand 3015 states and 5156 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:20,576 INFO L93 Difference]: Finished difference Result 7173 states and 12489 transitions. [2025-03-08 05:29:20,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:20,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2025-03-08 05:29:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:20,593 INFO L225 Difference]: With dead ends: 7173 [2025-03-08 05:29:20,594 INFO L226 Difference]: Without dead ends: 4727 [2025-03-08 05:29:20,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:20,599 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 55 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:20,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 400 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4727 states. [2025-03-08 05:29:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4727 to 4711. [2025-03-08 05:29:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4711 states, 4650 states have (on average 1.729247311827957) internal successors, (8041), 4654 states have internal predecessors, (8041), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4711 states to 4711 states and 8124 transitions. [2025-03-08 05:29:20,720 INFO L78 Accepts]: Start accepts. Automaton has 4711 states and 8124 transitions. Word has length 100 [2025-03-08 05:29:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:20,720 INFO L471 AbstractCegarLoop]: Abstraction has 4711 states and 8124 transitions. [2025-03-08 05:29:20,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4711 states and 8124 transitions. [2025-03-08 05:29:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:29:20,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:20,729 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:20,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:29:20,730 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:20,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2061581912, now seen corresponding path program 1 times [2025-03-08 05:29:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:20,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929285117] [2025-03-08 05:29:20,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:20,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:20,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:29:20,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:29:20,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:20,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:20,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:20,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929285117] [2025-03-08 05:29:20,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929285117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:20,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:20,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:20,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262648254] [2025-03-08 05:29:20,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:20,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:20,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:20,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:20,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:20,773 INFO L87 Difference]: Start difference. First operand 4711 states and 8124 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:20,875 INFO L93 Difference]: Finished difference Result 12175 states and 21201 transitions. [2025-03-08 05:29:20,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:20,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2025-03-08 05:29:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:20,907 INFO L225 Difference]: With dead ends: 12175 [2025-03-08 05:29:20,907 INFO L226 Difference]: Without dead ends: 8143 [2025-03-08 05:29:20,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:20,917 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 53 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:20,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 408 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8143 states. [2025-03-08 05:29:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8143 to 8127. [2025-03-08 05:29:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8127 states, 8066 states have (on average 1.71745598809819) internal successors, (13853), 8070 states have internal predecessors, (13853), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8127 states to 8127 states and 13936 transitions. [2025-03-08 05:29:21,198 INFO L78 Accepts]: Start accepts. Automaton has 8127 states and 13936 transitions. Word has length 101 [2025-03-08 05:29:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:21,199 INFO L471 AbstractCegarLoop]: Abstraction has 8127 states and 13936 transitions. [2025-03-08 05:29:21,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8127 states and 13936 transitions. [2025-03-08 05:29:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:29:21,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:21,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:29:21,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:29:21,215 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:21,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -844984134, now seen corresponding path program 1 times [2025-03-08 05:29:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:21,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711626266] [2025-03-08 05:29:21,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:21,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:29:21,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:29:21,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:21,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:21,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711626266] [2025-03-08 05:29:21,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711626266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:21,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:21,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:21,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639494185] [2025-03-08 05:29:21,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:21,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:21,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:21,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:21,265 INFO L87 Difference]: Start difference. First operand 8127 states and 13936 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:21,481 INFO L93 Difference]: Finished difference Result 21678 states and 37459 transitions. [2025-03-08 05:29:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:21,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2025-03-08 05:29:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:21,515 INFO L225 Difference]: With dead ends: 21678 [2025-03-08 05:29:21,515 INFO L226 Difference]: Without dead ends: 14545 [2025-03-08 05:29:21,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:21,527 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 51 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:21,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 408 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14545 states. [2025-03-08 05:29:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14545 to 14529. [2025-03-08 05:29:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14529 states, 14468 states have (on average 1.702723251313243) internal successors, (24635), 14472 states have internal predecessors, (24635), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14529 states to 14529 states and 24718 transitions. [2025-03-08 05:29:21,951 INFO L78 Accepts]: Start accepts. Automaton has 14529 states and 24718 transitions. Word has length 102 [2025-03-08 05:29:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:21,952 INFO L471 AbstractCegarLoop]: Abstraction has 14529 states and 24718 transitions. [2025-03-08 05:29:21,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 14529 states and 24718 transitions. [2025-03-08 05:29:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:29:21,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:21,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:21,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:29:21,981 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:21,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash -898504457, now seen corresponding path program 1 times [2025-03-08 05:29:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729502916] [2025-03-08 05:29:21,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:21,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:29:22,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:29:22,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:22,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:22,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:22,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729502916] [2025-03-08 05:29:22,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729502916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:22,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:22,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655344383] [2025-03-08 05:29:22,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:22,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:22,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:22,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:22,038 INFO L87 Difference]: Start difference. First operand 14529 states and 24718 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:22,386 INFO L93 Difference]: Finished difference Result 39897 states and 68221 transitions. [2025-03-08 05:29:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:22,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2025-03-08 05:29:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:22,464 INFO L225 Difference]: With dead ends: 39897 [2025-03-08 05:29:22,465 INFO L226 Difference]: Without dead ends: 26750 [2025-03-08 05:29:22,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:22,493 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 49 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:22,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 408 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26750 states. [2025-03-08 05:29:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26750 to 26734. [2025-03-08 05:29:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26734 states, 26673 states have (on average 1.6844374461065497) internal successors, (44929), 26677 states have internal predecessors, (44929), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26734 states to 26734 states and 45012 transitions. [2025-03-08 05:29:23,192 INFO L78 Accepts]: Start accepts. Automaton has 26734 states and 45012 transitions. Word has length 103 [2025-03-08 05:29:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:23,193 INFO L471 AbstractCegarLoop]: Abstraction has 26734 states and 45012 transitions. [2025-03-08 05:29:23,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 26734 states and 45012 transitions. [2025-03-08 05:29:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:29:23,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:23,230 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-03-08 05:29:23,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:29:23,230 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:23,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1505668851, now seen corresponding path program 1 times [2025-03-08 05:29:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:23,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798911872] [2025-03-08 05:29:23,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:23,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:29:23,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:29:23,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:23,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:29:23,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:23,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798911872] [2025-03-08 05:29:23,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798911872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:23,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274590739] [2025-03-08 05:29:23,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:23,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:23,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:23,399 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:29:23,400 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:29:23,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:29:23,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:29:23,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:23,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:23,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:29:23,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:29:23,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274590739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-08 05:29:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518607735] [2025-03-08 05:29:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:23,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:23,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:23,619 INFO L87 Difference]: Start difference. First operand 26734 states and 45012 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:23,864 INFO L93 Difference]: Finished difference Result 51457 states and 86916 transitions. [2025-03-08 05:29:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:23,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 104 [2025-03-08 05:29:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:23,927 INFO L225 Difference]: With dead ends: 51457 [2025-03-08 05:29:23,927 INFO L226 Difference]: Without dead ends: 26750 [2025-03-08 05:29:23,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:23,965 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 62 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:23,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 477 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26750 states. [2025-03-08 05:29:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26750 to 26734. [2025-03-08 05:29:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26734 states, 26673 states have (on average 1.6648296029692948) internal successors, (44406), 26677 states have internal predecessors, (44406), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26734 states to 26734 states and 44489 transitions. [2025-03-08 05:29:24,573 INFO L78 Accepts]: Start accepts. Automaton has 26734 states and 44489 transitions. Word has length 104 [2025-03-08 05:29:24,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:24,573 INFO L471 AbstractCegarLoop]: Abstraction has 26734 states and 44489 transitions. [2025-03-08 05:29:24,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 26734 states and 44489 transitions. [2025-03-08 05:29:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:29:24,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:24,610 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:29:24,617 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:29:24,810 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:29:24,811 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:24,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash -112136997, now seen corresponding path program 1 times [2025-03-08 05:29:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275424748] [2025-03-08 05:29:24,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:24,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:29:24,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:29:24,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:24,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:24,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:24,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275424748] [2025-03-08 05:29:24,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275424748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:24,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:24,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:24,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047022619] [2025-03-08 05:29:24,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:24,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:24,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:24,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:24,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:24,875 INFO L87 Difference]: Start difference. First operand 26734 states and 44489 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:25,423 INFO L93 Difference]: Finished difference Result 75147 states and 125300 transitions. [2025-03-08 05:29:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:25,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 104 [2025-03-08 05:29:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:25,563 INFO L225 Difference]: With dead ends: 75147 [2025-03-08 05:29:25,563 INFO L226 Difference]: Without dead ends: 50263 [2025-03-08 05:29:25,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:25,609 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 47 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:25,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 408 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:25,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50263 states. [2025-03-08 05:29:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50263 to 50247. [2025-03-08 05:29:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50247 states, 50186 states have (on average 1.6419120870362252) internal successors, (82401), 50190 states have internal predecessors, (82401), 41 states have call successors, (41), 17 states have call predecessors, (41), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-08 05:29:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50247 states to 50247 states and 82484 transitions. [2025-03-08 05:29:26,774 INFO L78 Accepts]: Start accepts. Automaton has 50247 states and 82484 transitions. Word has length 104 [2025-03-08 05:29:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:26,775 INFO L471 AbstractCegarLoop]: Abstraction has 50247 states and 82484 transitions. [2025-03-08 05:29:26,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 50247 states and 82484 transitions. [2025-03-08 05:29:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:29:26,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:26,821 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2025-03-08 05:29:26,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:29:26,821 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:26,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:26,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2078848028, now seen corresponding path program 1 times [2025-03-08 05:29:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:26,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939938508] [2025-03-08 05:29:26,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:26,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:29:26,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:29:26,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:26,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:29:26,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:26,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939938508] [2025-03-08 05:29:26,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939938508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:26,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925502677] [2025-03-08 05:29:26,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:26,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:26,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:26,945 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:29:26,947 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:29:27,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:29:27,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:29:27,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:27,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:27,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:29:27,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:27,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:27,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925502677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:27,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:27,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-08 05:29:27,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328365379] [2025-03-08 05:29:27,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:27,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:29:27,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:27,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:29:27,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:29:27,210 INFO L87 Difference]: Start difference. First operand 50247 states and 82484 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:29:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:27,835 INFO L93 Difference]: Finished difference Result 98548 states and 161969 transitions. [2025-03-08 05:29:27,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:29:27,835 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), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 105 [2025-03-08 05:29:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:27,974 INFO L225 Difference]: With dead ends: 98548 [2025-03-08 05:29:27,975 INFO L226 Difference]: Without dead ends: 50255 [2025-03-08 05:29:28,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:28,014 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 181 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:28,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 425 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50255 states. [2025-03-08 05:29:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50255 to 50251. [2025-03-08 05:29:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50251 states, 50190 states have (on average 1.6200637577206616) internal successors, (81311), 50193 states have internal predecessors, (81311), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-08 05:29:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50251 states to 50251 states and 81392 transitions. [2025-03-08 05:29:29,106 INFO L78 Accepts]: Start accepts. Automaton has 50251 states and 81392 transitions. Word has length 105 [2025-03-08 05:29:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:29,106 INFO L471 AbstractCegarLoop]: Abstraction has 50251 states and 81392 transitions. [2025-03-08 05:29:29,107 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), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:29:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 50251 states and 81392 transitions. [2025-03-08 05:29:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:29:29,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:29,155 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:29:29,162 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:29:29,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:29,356 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:29,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash 47786518, now seen corresponding path program 1 times [2025-03-08 05:29:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:29,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205996893] [2025-03-08 05:29:29,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:29,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:29:29,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:29:29,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:29,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205996893] [2025-03-08 05:29:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205996893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136609579] [2025-03-08 05:29:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:29,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:29,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:29,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:29,593 INFO L87 Difference]: Start difference. First operand 50251 states and 81392 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:30,147 INFO L93 Difference]: Finished difference Result 95620 states and 154486 transitions. [2025-03-08 05:29:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:30,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 105 [2025-03-08 05:29:30,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:30,355 INFO L225 Difference]: With dead ends: 95620 [2025-03-08 05:29:30,355 INFO L226 Difference]: Without dead ends: 95414 [2025-03-08 05:29:30,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:30,394 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 42 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:30,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 415 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95414 states. [2025-03-08 05:29:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95414 to 95398. [2025-03-08 05:29:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95398 states, 95337 states have (on average 1.5941135131166284) internal successors, (151978), 95340 states have internal predecessors, (151978), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-08 05:29:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95398 states to 95398 states and 152059 transitions. [2025-03-08 05:29:32,520 INFO L78 Accepts]: Start accepts. Automaton has 95398 states and 152059 transitions. Word has length 105 [2025-03-08 05:29:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:32,520 INFO L471 AbstractCegarLoop]: Abstraction has 95398 states and 152059 transitions. [2025-03-08 05:29:32,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 95398 states and 152059 transitions. [2025-03-08 05:29:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:29:32,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:32,854 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2025-03-08 05:29:32,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:29:32,854 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:32,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1402209418, now seen corresponding path program 1 times [2025-03-08 05:29:32,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:32,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546748614] [2025-03-08 05:29:32,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:32,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:32,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:29:32,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:29:32,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:32,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 05:29:32,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:32,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546748614] [2025-03-08 05:29:32,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546748614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:32,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:32,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961744097] [2025-03-08 05:29:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:32,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:32,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:32,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:32,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:32,961 INFO L87 Difference]: Start difference. First operand 95398 states and 152059 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:29:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:34,300 INFO L93 Difference]: Finished difference Result 192809 states and 305089 transitions. [2025-03-08 05:29:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 106 [2025-03-08 05:29:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:34,720 INFO L225 Difference]: With dead ends: 192809 [2025-03-08 05:29:34,720 INFO L226 Difference]: Without dead ends: 192619 [2025-03-08 05:29:34,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:29:34,769 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 154 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:34,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1222 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192619 states. [2025-03-08 05:29:37,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192619 to 188456. [2025-03-08 05:29:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188456 states, 188341 states have (on average 1.595611152112392) internal successors, (300519), 188346 states have internal predecessors, (300519), 79 states have call successors, (79), 34 states have call predecessors, (79), 35 states have return successors, (76), 75 states have call predecessors, (76), 75 states have call successors, (76) [2025-03-08 05:29:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188456 states to 188456 states and 300674 transitions. [2025-03-08 05:29:38,509 INFO L78 Accepts]: Start accepts. Automaton has 188456 states and 300674 transitions. Word has length 106 [2025-03-08 05:29:38,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:38,510 INFO L471 AbstractCegarLoop]: Abstraction has 188456 states and 300674 transitions. [2025-03-08 05:29:38,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:29:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 188456 states and 300674 transitions. [2025-03-08 05:29:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:29:39,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:39,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:29:39,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:29:39,056 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:39,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1122669956, now seen corresponding path program 1 times [2025-03-08 05:29:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108243400] [2025-03-08 05:29:39,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:39,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:29:39,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:29:39,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:39,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:39,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:39,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108243400] [2025-03-08 05:29:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108243400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:39,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837021319] [2025-03-08 05:29:39,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:39,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:39,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:39,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:39,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:39,140 INFO L87 Difference]: Start difference. First operand 188456 states and 300674 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:41,953 INFO L93 Difference]: Finished difference Result 373110 states and 595769 transitions. [2025-03-08 05:29:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:41,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 106 [2025-03-08 05:29:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:43,094 INFO L225 Difference]: With dead ends: 373110 [2025-03-08 05:29:43,095 INFO L226 Difference]: Without dead ends: 372728 [2025-03-08 05:29:43,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:43,165 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 146 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:43,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 785 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372728 states. [2025-03-08 05:29:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372728 to 372710. [2025-03-08 05:29:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372710 states, 372487 states have (on average 1.597210103976783) internal successors, (594940), 372496 states have internal predecessors, (594940), 155 states have call successors, (155), 66 states have call predecessors, (155), 67 states have return successors, (148), 147 states have call predecessors, (148), 147 states have call successors, (148) [2025-03-08 05:29:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372710 states to 372710 states and 595243 transitions. [2025-03-08 05:29:50,082 INFO L78 Accepts]: Start accepts. Automaton has 372710 states and 595243 transitions. Word has length 106 [2025-03-08 05:29:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:50,082 INFO L471 AbstractCegarLoop]: Abstraction has 372710 states and 595243 transitions. [2025-03-08 05:29:50,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:29:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 372710 states and 595243 transitions. [2025-03-08 05:29:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:29:50,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:50,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:29:50,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:29:50,712 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:50,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:50,712 INFO L85 PathProgramCache]: Analyzing trace with hash 715162948, now seen corresponding path program 1 times [2025-03-08 05:29:50,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:50,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848839809] [2025-03-08 05:29:50,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:50,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:50,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:29:50,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:29:50,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:50,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:29:50,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:50,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848839809] [2025-03-08 05:29:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848839809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:50,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219963933] [2025-03-08 05:29:50,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:50,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:50,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:50,937 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:29:50,938 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:29:51,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:29:51,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:29:51,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:51,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:51,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:29:51,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:29:51,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:51,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219963933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:51,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:51,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2025-03-08 05:29:51,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764107149] [2025-03-08 05:29:51,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:51,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:29:51,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:51,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:29:51,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:29:51,437 INFO L87 Difference]: Start difference. First operand 372710 states and 595243 transitions. Second operand has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 05:29:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:54,787 INFO L93 Difference]: Finished difference Result 374690 states and 598045 transitions. [2025-03-08 05:29:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:29:54,788 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 107 [2025-03-08 05:29:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:55,673 INFO L225 Difference]: With dead ends: 374690 [2025-03-08 05:29:55,673 INFO L226 Difference]: Without dead ends: 373908 [2025-03-08 05:29:55,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 05:29:55,783 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 472 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:55,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 2014 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:29:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373908 states.