./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product13.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_spec4_product13.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 a4d75af8ac92d9f5b92cf5fbd6315f6202b8108aa1e42fc32d65f286c89fdf2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:33:39,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:33:39,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:33:39,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:33:39,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:33:39,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:33:39,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:33:39,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:33:39,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:33:39,921 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:33:39,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:33:39,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:33:39,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:33:39,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:33:39,922 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:33:39,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:33:39,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:33:39,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:33:39,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:33:39,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:33:39,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:33:39,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:33:39,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:33:39,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:33:39,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:33:39,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:33:39,924 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:33:39,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:33:39,924 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:33:39,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:33:39,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:33:39,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:33:39,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:33:39,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:33:39,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:33:39,925 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:33:39,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:33:39,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:33:39,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:33:39,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:33:39,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:33:39,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:33:39,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:33:39,925 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 -> a4d75af8ac92d9f5b92cf5fbd6315f6202b8108aa1e42fc32d65f286c89fdf2f [2025-03-08 05:33:40,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:33:40,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:33:40,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:33:40,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:33:40,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:33:40,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product13.cil.c [2025-03-08 05:33:41,344 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8e63469/3f2b129be39b40a09500da141483ac6b/FLAGbede117d2 [2025-03-08 05:33:41,715 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:33:41,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c [2025-03-08 05:33:41,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8e63469/3f2b129be39b40a09500da141483ac6b/FLAGbede117d2 [2025-03-08 05:33:41,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8e63469/3f2b129be39b40a09500da141483ac6b [2025-03-08 05:33:41,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:33:41,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:33:41,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:33:41,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:33:41,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:33:41,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:41" (1/1) ... [2025-03-08 05:33:41,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@631e70ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:41, skipping insertion in model container [2025-03-08 05:33:41,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:41" (1/1) ... [2025-03-08 05:33:41,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:33:42,350 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_spec4_product13.cil.c[42804,42817] [2025-03-08 05:33:42,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:33:42,454 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:33:42,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [48] [2025-03-08 05:33:42,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [90] [2025-03-08 05:33:42,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [456] [2025-03-08 05:33:42,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [474] [2025-03-08 05:33:42,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [512] [2025-03-08 05:33:42,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1591] [2025-03-08 05:33:42,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1871] [2025-03-08 05:33:42,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1880] [2025-03-08 05:33:42,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2093] [2025-03-08 05:33:42,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2504] [2025-03-08 05:33:42,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2758] [2025-03-08 05:33:42,539 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_spec4_product13.cil.c[42804,42817] [2025-03-08 05:33:42,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:33:42,594 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:33:42,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42 WrapperNode [2025-03-08 05:33:42,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:33:42,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:33:42,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:33:42,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:33:42,600 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:33:42" (1/1) ... [2025-03-08 05:33:42,614 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:33:42" (1/1) ... [2025-03-08 05:33:42,655 INFO L138 Inliner]: procedures = 124, calls = 177, calls flagged for inlining = 53, calls inlined = 44, statements flattened = 840 [2025-03-08 05:33:42,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:33:42,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:33:42,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:33:42,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:33:42,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (1/1) ... [2025-03-08 05:33:42,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (1/1) ... [2025-03-08 05:33:42,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (1/1) ... [2025-03-08 05:33:42,688 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:33:42,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (1/1) ... [2025-03-08 05:33:42,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (1/1) ... [2025-03-08 05:33:42,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (1/1) ... [2025-03-08 05:33:42,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (1/1) ... [2025-03-08 05:33:42,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (1/1) ... [2025-03-08 05:33:42,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (1/1) ... [2025-03-08 05:33:42,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:33:42,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:33:42,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:33:42,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:33:42,708 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (1/1) ... [2025-03-08 05:33:42,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:33:42,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:42,739 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:33:42,741 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:33:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:33:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:33:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:33:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:33:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:33:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:33:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:33:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:33:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:33:42,759 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:33:42,759 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:33:42,759 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:33:42,759 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:33:42,759 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:33:42,759 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:33:42,759 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:33:42,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:33:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:33:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:33:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:33:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:33:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:33:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:33:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:33:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:33:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:33:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:33:42,910 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:33:42,912 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:33:42,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2448: #res := ~retValue_acc~33; [2025-03-08 05:33:43,148 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1449-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~20#1; [2025-03-08 05:33:43,148 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1568-1: getClientId_#res#1 := getClientId_~retValue_acc~22#1; [2025-03-08 05:33:43,148 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~39#1; [2025-03-08 05:33:43,158 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411: #res := ~retValue_acc~32; [2025-03-08 05:33:43,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2222: #res := ~retValue_acc~27; [2025-03-08 05:33:43,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1180-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~16#1; [2025-03-08 05:33:43,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1225: #res#1 := ~retValue_acc~17#1; [2025-03-08 05:33:43,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1133: #res := ~retValue_acc~15; [2025-03-08 05:33:43,301 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2852-1: createEmail_#res#1 := createEmail_~retValue_acc~42#1; [2025-03-08 05:33:43,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L509-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-03-08 05:33:43,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2633-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~36#1; [2025-03-08 05:33:43,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1395-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~19#1; [2025-03-08 05:33:43,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2642-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~37#1; [2025-03-08 05:33:43,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1288-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~18#1; [2025-03-08 05:33:43,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2651-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~38#1; [2025-03-08 05:33:43,556 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2185: #res := ~retValue_acc~26; [2025-03-08 05:33:43,559 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2828: #res := ~retValue_acc~40; [2025-03-08 05:33:43,671 INFO L? ?]: Removed 363 outVars from TransFormulas that were not future-live. [2025-03-08 05:33:43,672 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:33:43,686 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:33:43,689 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:33:43,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:43 BoogieIcfgContainer [2025-03-08 05:33:43,690 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:33:43,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:33:43,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:33:43,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:33:43,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:33:41" (1/3) ... [2025-03-08 05:33:43,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edf50d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:43, skipping insertion in model container [2025-03-08 05:33:43,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:42" (2/3) ... [2025-03-08 05:33:43,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edf50d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:43, skipping insertion in model container [2025-03-08 05:33:43,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:43" (3/3) ... [2025-03-08 05:33:43,697 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product13.cil.c [2025-03-08 05:33:43,710 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:33:43,713 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product13.cil.c that has 17 procedures, 269 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:33:43,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:33:43,776 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;@237e9f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:33:43,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:33:43,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 269 states, 214 states have (on average 1.5514018691588785) internal successors, (332), 216 states have internal predecessors, (332), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 05:33:43,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 05:33:43,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:43,794 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 05:33:43,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:43,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1517142345, now seen corresponding path program 1 times [2025-03-08 05:33:43,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:43,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655968457] [2025-03-08 05:33:43,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:43,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:33:43,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:33:43,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:43,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:33:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655968457] [2025-03-08 05:33:44,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655968457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:44,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137512825] [2025-03-08 05:33:44,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:44,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:44,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:44,333 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:33:44,335 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:33:44,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:33:44,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:33:44,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:44,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:44,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:33:44,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:33:44,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137512825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:44,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:33:44,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540335584] [2025-03-08 05:33:44,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:44,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:44,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:44,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:44,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:33:44,649 INFO L87 Difference]: Start difference. First operand has 269 states, 214 states have (on average 1.5514018691588785) internal successors, (332), 216 states have internal predecessors, (332), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:44,699 INFO L93 Difference]: Finished difference Result 392 states and 580 transitions. [2025-03-08 05:33:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:44,702 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-03-08 05:33:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:44,708 INFO L225 Difference]: With dead ends: 392 [2025-03-08 05:33:44,708 INFO L226 Difference]: Without dead ends: 263 [2025-03-08 05:33:44,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 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:33:44,717 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 801 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:33:44,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 801 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-08 05:33:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-08 05:33:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 210 states have internal predecessors, (323), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 05:33:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2025-03-08 05:33:44,760 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 89 [2025-03-08 05:33:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:44,760 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2025-03-08 05:33:44,761 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2025-03-08 05:33:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:33:44,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:44,766 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2025-03-08 05:33:44,776 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:33:44,967 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:33:44,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:44,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:44,967 INFO L85 PathProgramCache]: Analyzing trace with hash -566029841, now seen corresponding path program 1 times [2025-03-08 05:33:44,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:44,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809449400] [2025-03-08 05:33:44,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:44,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:33:45,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:33:45,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:45,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:33:45,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:45,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809449400] [2025-03-08 05:33:45,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809449400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:45,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196118546] [2025-03-08 05:33:45,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:45,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:45,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:45,190 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:33:45,192 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:33:45,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:33:45,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:33:45,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:45,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:45,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:33:45,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:45,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:33:45,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:45,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196118546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:45,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:45,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:33:45,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120533587] [2025-03-08 05:33:45,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:45,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:45,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:45,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:45,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:33:45,444 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:45,487 INFO L93 Difference]: Finished difference Result 550 states and 842 transitions. [2025-03-08 05:33:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:45,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2025-03-08 05:33:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:45,491 INFO L225 Difference]: With dead ends: 550 [2025-03-08 05:33:45,493 INFO L226 Difference]: Without dead ends: 313 [2025-03-08 05:33:45,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 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:33:45,497 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 99 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 747 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:33:45,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 747 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-08 05:33:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 305. [2025-03-08 05:33:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 240 states have (on average 1.5625) internal successors, (375), 241 states have internal predecessors, (375), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 05:33:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 470 transitions. [2025-03-08 05:33:45,519 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 470 transitions. Word has length 93 [2025-03-08 05:33:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:45,520 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 470 transitions. [2025-03-08 05:33:45,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 470 transitions. [2025-03-08 05:33:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:33:45,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:45,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2025-03-08 05:33:45,533 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:33:45,725 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:33:45,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:45,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:45,726 INFO L85 PathProgramCache]: Analyzing trace with hash -262282214, now seen corresponding path program 1 times [2025-03-08 05:33:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:45,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313717159] [2025-03-08 05:33:45,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:45,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:33:45,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:33:45,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:45,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:33:45,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313717159] [2025-03-08 05:33:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313717159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953781709] [2025-03-08 05:33:45,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:45,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:45,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:45,941 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:33:45,943 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:33:46,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:33:46,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:33:46,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:46,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:46,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:33:46,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:33:46,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953781709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:46,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:33:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976938171] [2025-03-08 05:33:46,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:46,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:46,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:46,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:46,218 INFO L87 Difference]: Start difference. First operand 305 states and 470 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:33:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:46,262 INFO L93 Difference]: Finished difference Result 601 states and 930 transitions. [2025-03-08 05:33:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:46,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 94 [2025-03-08 05:33:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:46,265 INFO L225 Difference]: With dead ends: 601 [2025-03-08 05:33:46,265 INFO L226 Difference]: Without dead ends: 307 [2025-03-08 05:33:46,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 92 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:33:46,267 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 2 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1537 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:33:46,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1537 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-08 05:33:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2025-03-08 05:33:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 241 states have (on average 1.5601659751037344) internal successors, (376), 243 states have internal predecessors, (376), 48 states have call successors, (48), 16 states have call predecessors, (48), 17 states have return successors, (49), 47 states have call predecessors, (49), 47 states have call successors, (49) [2025-03-08 05:33:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 473 transitions. [2025-03-08 05:33:46,286 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 473 transitions. Word has length 94 [2025-03-08 05:33:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:46,287 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 473 transitions. [2025-03-08 05:33:46,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:33:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 473 transitions. [2025-03-08 05:33:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:33:46,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:46,289 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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:33:46,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:33:46,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:46,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:46,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:46,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1890984176, now seen corresponding path program 1 times [2025-03-08 05:33:46,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:46,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127779779] [2025-03-08 05:33:46,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:46,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:46,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:33:46,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:33:46,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:46,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:33:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:46,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127779779] [2025-03-08 05:33:46,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127779779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:46,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047066728] [2025-03-08 05:33:46,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:46,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:46,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:46,662 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:33:46,665 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:33:46,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:33:46,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:33:46,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:46,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:46,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:33:46,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:33:46,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:46,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047066728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:46,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:46,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:33:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180283182] [2025-03-08 05:33:46,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:46,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:46,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:46,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:46,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:33:46,935 INFO L87 Difference]: Start difference. First operand 307 states and 473 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:33:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:46,991 INFO L93 Difference]: Finished difference Result 603 states and 935 transitions. [2025-03-08 05:33:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:46,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 95 [2025-03-08 05:33:46,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:46,994 INFO L225 Difference]: With dead ends: 603 [2025-03-08 05:33:46,994 INFO L226 Difference]: Without dead ends: 309 [2025-03-08 05:33:46,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:33:46,995 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 2 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:46,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1523 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:46,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-08 05:33:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-03-08 05:33:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 242 states have (on average 1.5578512396694215) internal successors, (377), 245 states have internal predecessors, (377), 48 states have call successors, (48), 16 states have call predecessors, (48), 18 states have return successors, (54), 47 states have call predecessors, (54), 47 states have call successors, (54) [2025-03-08 05:33:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 479 transitions. [2025-03-08 05:33:47,009 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 479 transitions. Word has length 95 [2025-03-08 05:33:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:47,010 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 479 transitions. [2025-03-08 05:33:47,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:33:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 479 transitions. [2025-03-08 05:33:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 05:33:47,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:47,012 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 05:33:47,020 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:33:47,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:47,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:47,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:47,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2019291827, now seen corresponding path program 1 times [2025-03-08 05:33:47,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:47,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651781826] [2025-03-08 05:33:47,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:47,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:47,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:33:47,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:33:47,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:47,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:33:47,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:47,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651781826] [2025-03-08 05:33:47,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651781826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:47,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:47,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:33:47,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336550650] [2025-03-08 05:33:47,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:47,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:47,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:47,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:47,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:33:47,353 INFO L87 Difference]: Start difference. First operand 309 states and 479 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:33:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:47,387 INFO L93 Difference]: Finished difference Result 595 states and 926 transitions. [2025-03-08 05:33:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:47,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2025-03-08 05:33:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:47,390 INFO L225 Difference]: With dead ends: 595 [2025-03-08 05:33:47,390 INFO L226 Difference]: Without dead ends: 309 [2025-03-08 05:33:47,391 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:33:47,391 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 2 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1541 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:33:47,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1541 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-08 05:33:47,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-03-08 05:33:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 242 states have (on average 1.5578512396694215) internal successors, (377), 245 states have internal predecessors, (377), 48 states have call successors, (48), 16 states have call predecessors, (48), 18 states have return successors, (53), 47 states have call predecessors, (53), 47 states have call successors, (53) [2025-03-08 05:33:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 478 transitions. [2025-03-08 05:33:47,409 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 478 transitions. Word has length 96 [2025-03-08 05:33:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:47,410 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 478 transitions. [2025-03-08 05:33:47,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:33:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 478 transitions. [2025-03-08 05:33:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:33:47,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:47,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:33:47,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:33:47,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:47,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:47,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1013527359, now seen corresponding path program 2 times [2025-03-08 05:33:47,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:47,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643150344] [2025-03-08 05:33:47,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:33:47,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:47,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-03-08 05:33:47,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 97 statements. [2025-03-08 05:33:47,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:33:47,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:33:47,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643150344] [2025-03-08 05:33:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643150344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:47,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:47,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:33:47,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135787694] [2025-03-08 05:33:47,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:47,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:33:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:47,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:33:47,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:47,559 INFO L87 Difference]: Start difference. First operand 309 states and 478 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:47,821 INFO L93 Difference]: Finished difference Result 628 states and 979 transitions. [2025-03-08 05:33:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:33:47,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2025-03-08 05:33:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:47,825 INFO L225 Difference]: With dead ends: 628 [2025-03-08 05:33:47,825 INFO L226 Difference]: Without dead ends: 624 [2025-03-08 05:33:47,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:33:47,827 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 659 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:47,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2339 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:33:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-08 05:33:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 613. [2025-03-08 05:33:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 482 states have (on average 1.5643153526970954) internal successors, (754), 485 states have internal predecessors, (754), 94 states have call successors, (94), 33 states have call predecessors, (94), 36 states have return successors, (108), 94 states have call predecessors, (108), 92 states have call successors, (108) [2025-03-08 05:33:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 956 transitions. [2025-03-08 05:33:47,864 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 956 transitions. Word has length 97 [2025-03-08 05:33:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:47,864 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 956 transitions. [2025-03-08 05:33:47,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 956 transitions. [2025-03-08 05:33:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:33:47,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:47,870 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 05:33:47,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:33:47,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:47,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:47,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1655939593, now seen corresponding path program 1 times [2025-03-08 05:33:47,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:47,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541143259] [2025-03-08 05:33:47,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:47,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:47,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:33:47,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:33:47,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:47,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:33:47,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:47,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541143259] [2025-03-08 05:33:47,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541143259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:47,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:47,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:33:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390575206] [2025-03-08 05:33:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:47,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:47,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:47,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:47,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:33:47,993 INFO L87 Difference]: Start difference. First operand 613 states and 956 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:33:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:48,036 INFO L93 Difference]: Finished difference Result 1195 states and 1872 transitions. [2025-03-08 05:33:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:48,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2025-03-08 05:33:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:48,040 INFO L225 Difference]: With dead ends: 1195 [2025-03-08 05:33:48,040 INFO L226 Difference]: Without dead ends: 617 [2025-03-08 05:33:48,042 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:33:48,043 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 1 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1544 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:33:48,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1544 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-08 05:33:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2025-03-08 05:33:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 484 states have (on average 1.56198347107438) internal successors, (756), 489 states have internal predecessors, (756), 94 states have call successors, (94), 33 states have call predecessors, (94), 38 states have return successors, (111), 94 states have call predecessors, (111), 92 states have call successors, (111) [2025-03-08 05:33:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 961 transitions. [2025-03-08 05:33:48,069 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 961 transitions. Word has length 98 [2025-03-08 05:33:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:48,069 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 961 transitions. [2025-03-08 05:33:48,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:33:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 961 transitions. [2025-03-08 05:33:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:33:48,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:48,072 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:33:48,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:33:48,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:48,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:48,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1638232850, now seen corresponding path program 1 times [2025-03-08 05:33:48,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:48,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826090764] [2025-03-08 05:33:48,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:48,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:48,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:33:48,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:33:48,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:48,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:33:48,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826090764] [2025-03-08 05:33:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826090764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:48,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:48,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:33:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735063952] [2025-03-08 05:33:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:48,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:33:48,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:48,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:33:48,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:48,188 INFO L87 Difference]: Start difference. First operand 617 states and 961 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:33:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:48,297 INFO L93 Difference]: Finished difference Result 1194 states and 1865 transitions. [2025-03-08 05:33:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:33:48,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 99 [2025-03-08 05:33:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:48,302 INFO L225 Difference]: With dead ends: 1194 [2025-03-08 05:33:48,302 INFO L226 Difference]: Without dead ends: 621 [2025-03-08 05:33:48,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:33:48,305 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 7 mSDsluCounter, 2245 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:48,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2624 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:33:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-08 05:33:48,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 619. [2025-03-08 05:33:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 486 states have (on average 1.559670781893004) internal successors, (758), 490 states have internal predecessors, (758), 94 states have call successors, (94), 34 states have call predecessors, (94), 38 states have return successors, (109), 94 states have call predecessors, (109), 92 states have call successors, (109) [2025-03-08 05:33:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 961 transitions. [2025-03-08 05:33:48,330 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 961 transitions. Word has length 99 [2025-03-08 05:33:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:48,330 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 961 transitions. [2025-03-08 05:33:48,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:33:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 961 transitions. [2025-03-08 05:33:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 05:33:48,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:48,333 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 05:33:48,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:33:48,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:48,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash -584546811, now seen corresponding path program 2 times [2025-03-08 05:33:48,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:48,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40500492] [2025-03-08 05:33:48,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:33:48,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:48,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-08 05:33:48,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 100 statements. [2025-03-08 05:33:48,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:33:48,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:33:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40500492] [2025-03-08 05:33:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40500492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:48,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:33:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958571423] [2025-03-08 05:33:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:48,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:33:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:48,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:33:48,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:48,443 INFO L87 Difference]: Start difference. First operand 619 states and 961 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:48,704 INFO L93 Difference]: Finished difference Result 1264 states and 1982 transitions. [2025-03-08 05:33:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:33:48,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-03-08 05:33:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:48,711 INFO L225 Difference]: With dead ends: 1264 [2025-03-08 05:33:48,711 INFO L226 Difference]: Without dead ends: 1258 [2025-03-08 05:33:48,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:33:48,713 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 361 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:48,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 2753 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:33:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2025-03-08 05:33:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1235. [2025-03-08 05:33:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 970 states have (on average 1.5618556701030928) internal successors, (1515), 980 states have internal predecessors, (1515), 184 states have call successors, (184), 68 states have call predecessors, (184), 80 states have return successors, (240), 186 states have call predecessors, (240), 180 states have call successors, (240) [2025-03-08 05:33:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1939 transitions. [2025-03-08 05:33:48,770 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1939 transitions. Word has length 100 [2025-03-08 05:33:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:48,770 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1939 transitions. [2025-03-08 05:33:48,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1939 transitions. [2025-03-08 05:33:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 05:33:48,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:48,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:33:48,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:33:48,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:48,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:48,775 INFO L85 PathProgramCache]: Analyzing trace with hash 741251890, now seen corresponding path program 1 times [2025-03-08 05:33:48,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:48,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120223793] [2025-03-08 05:33:48,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:48,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:48,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 05:33:48,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:33:48,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:48,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 05:33:48,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120223793] [2025-03-08 05:33:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120223793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864165252] [2025-03-08 05:33:48,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:48,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:48,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:48,854 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:33:48,855 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:33:48,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 05:33:49,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:33:49,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:49,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:49,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:33:49,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:33:49,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:49,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864165252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:49,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:49,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:33:49,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297734721] [2025-03-08 05:33:49,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:49,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:49,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:49,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:49,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:49,087 INFO L87 Difference]: Start difference. First operand 1235 states and 1939 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:49,153 INFO L93 Difference]: Finished difference Result 1865 states and 2920 transitions. [2025-03-08 05:33:49,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:49,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-03-08 05:33:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:49,161 INFO L225 Difference]: With dead ends: 1865 [2025-03-08 05:33:49,162 INFO L226 Difference]: Without dead ends: 1239 [2025-03-08 05:33:49,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 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:33:49,164 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 1 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:49,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1534 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-03-08 05:33:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1231. [2025-03-08 05:33:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 968 states have (on average 1.56198347107438) internal successors, (1512), 978 states have internal predecessors, (1512), 182 states have call successors, (182), 68 states have call predecessors, (182), 80 states have return successors, (238), 184 states have call predecessors, (238), 178 states have call successors, (238) [2025-03-08 05:33:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1932 transitions. [2025-03-08 05:33:49,215 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1932 transitions. Word has length 100 [2025-03-08 05:33:49,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:49,216 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1932 transitions. [2025-03-08 05:33:49,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1932 transitions. [2025-03-08 05:33:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:33:49,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:49,220 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 05:33:49,227 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:33:49,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:33:49,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:49,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1306144592, now seen corresponding path program 1 times [2025-03-08 05:33:49,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:49,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798688531] [2025-03-08 05:33:49,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:49,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:33:49,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:33:49,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:49,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:33:49,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:49,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798688531] [2025-03-08 05:33:49,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798688531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:49,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:49,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:33:49,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047962290] [2025-03-08 05:33:49,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:49,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:33:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:49,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:33:49,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:49,538 INFO L87 Difference]: Start difference. First operand 1231 states and 1932 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:33:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:49,662 INFO L93 Difference]: Finished difference Result 2403 states and 3780 transitions. [2025-03-08 05:33:49,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:33:49,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2025-03-08 05:33:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:49,669 INFO L225 Difference]: With dead ends: 2403 [2025-03-08 05:33:49,670 INFO L226 Difference]: Without dead ends: 1239 [2025-03-08 05:33:49,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:33:49,674 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 5 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:49,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2638 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:33:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-03-08 05:33:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1235. [2025-03-08 05:33:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 972 states have (on average 1.559670781893004) internal successors, (1516), 981 states have internal predecessors, (1516), 182 states have call successors, (182), 69 states have call predecessors, (182), 80 states have return successors, (234), 184 states have call predecessors, (234), 178 states have call successors, (234) [2025-03-08 05:33:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1932 transitions. [2025-03-08 05:33:49,725 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1932 transitions. Word has length 101 [2025-03-08 05:33:49,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:49,725 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1932 transitions. [2025-03-08 05:33:49,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:33:49,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1932 transitions. [2025-03-08 05:33:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:33:49,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:49,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:33:49,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:33:49,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:49,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2089794628, now seen corresponding path program 1 times [2025-03-08 05:33:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:49,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614580893] [2025-03-08 05:33:49,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:49,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:33:49,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:33:49,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:49,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:33:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:49,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614580893] [2025-03-08 05:33:49,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614580893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:49,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071198446] [2025-03-08 05:33:49,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:49,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:49,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:49,809 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:33:49,810 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:33:49,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:33:49,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:33:49,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:49,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:49,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:33:49,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:33:50,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:33:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:33:50,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071198446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:33:50,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:33:50,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:33:50,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236222980] [2025-03-08 05:33:50,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:33:50,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:33:50,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:50,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:33:50,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:33:50,081 INFO L87 Difference]: Start difference. First operand 1235 states and 1932 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:33:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:50,261 INFO L93 Difference]: Finished difference Result 2969 states and 4856 transitions. [2025-03-08 05:33:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:33:50,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2025-03-08 05:33:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:50,273 INFO L225 Difference]: With dead ends: 2969 [2025-03-08 05:33:50,273 INFO L226 Difference]: Without dead ends: 2499 [2025-03-08 05:33:50,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 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:33:50,275 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 476 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:50,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1797 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:33:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2025-03-08 05:33:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2403. [2025-03-08 05:33:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 1884 states have (on average 1.6263269639065818) internal successors, (3064), 1893 states have internal predecessors, (3064), 438 states have call successors, (438), 69 states have call predecessors, (438), 80 states have return successors, (570), 440 states have call predecessors, (570), 434 states have call successors, (570) [2025-03-08 05:33:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 4072 transitions. [2025-03-08 05:33:50,385 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 4072 transitions. Word has length 102 [2025-03-08 05:33:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:50,386 INFO L471 AbstractCegarLoop]: Abstraction has 2403 states and 4072 transitions. [2025-03-08 05:33:50,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:33:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 4072 transitions. [2025-03-08 05:33:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:33:50,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:50,398 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:33:50,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:33:50,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:50,599 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:50,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -218729332, now seen corresponding path program 1 times [2025-03-08 05:33:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:50,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73844789] [2025-03-08 05:33:50,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:50,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:33:50,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:33:50,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:50,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:33:50,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73844789] [2025-03-08 05:33:50,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73844789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:50,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:50,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:50,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097598278] [2025-03-08 05:33:50,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:50,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:50,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:50,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:50,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:50,666 INFO L87 Difference]: Start difference. First operand 2403 states and 4072 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:50,757 INFO L93 Difference]: Finished difference Result 5773 states and 9944 transitions. [2025-03-08 05:33:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:50,758 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-03-08 05:33:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:50,779 INFO L225 Difference]: With dead ends: 5773 [2025-03-08 05:33:50,780 INFO L226 Difference]: Without dead ends: 3587 [2025-03-08 05:33:50,789 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:33:50,790 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 97 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 792 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:33:50,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 792 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2025-03-08 05:33:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 3555. [2025-03-08 05:33:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3555 states, 2780 states have (on average 1.6388489208633092) internal successors, (4556), 2789 states have internal predecessors, (4556), 694 states have call successors, (694), 69 states have call predecessors, (694), 80 states have return successors, (906), 696 states have call predecessors, (906), 690 states have call successors, (906) [2025-03-08 05:33:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 6156 transitions. [2025-03-08 05:33:50,971 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 6156 transitions. Word has length 109 [2025-03-08 05:33:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:50,971 INFO L471 AbstractCegarLoop]: Abstraction has 3555 states and 6156 transitions. [2025-03-08 05:33:50,971 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 6156 transitions. [2025-03-08 05:33:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:33:50,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:50,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:33:50,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:33:50,989 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:50,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1696289808, now seen corresponding path program 1 times [2025-03-08 05:33:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659207800] [2025-03-08 05:33:50,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:51,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:33:51,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:33:51,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:51,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:33:51,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:51,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659207800] [2025-03-08 05:33:51,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659207800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:51,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:51,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888869093] [2025-03-08 05:33:51,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:51,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:51,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:51,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:51,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:51,035 INFO L87 Difference]: Start difference. First operand 3555 states and 6156 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:51,168 INFO L93 Difference]: Finished difference Result 8521 states and 14852 transitions. [2025-03-08 05:33:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:51,168 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-03-08 05:33:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:51,200 INFO L225 Difference]: With dead ends: 8521 [2025-03-08 05:33:51,201 INFO L226 Difference]: Without dead ends: 5379 [2025-03-08 05:33:51,215 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:33:51,216 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 95 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 784 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:33:51,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 784 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2025-03-08 05:33:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 5347. [2025-03-08 05:33:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5347 states, 4192 states have (on average 1.6469465648854962) internal successors, (6904), 4201 states have internal predecessors, (6904), 1074 states have call successors, (1074), 69 states have call predecessors, (1074), 80 states have return successors, (1350), 1076 states have call predecessors, (1350), 1070 states have call successors, (1350) [2025-03-08 05:33:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 9328 transitions. [2025-03-08 05:33:51,485 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 9328 transitions. Word has length 110 [2025-03-08 05:33:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:51,487 INFO L471 AbstractCegarLoop]: Abstraction has 5347 states and 9328 transitions. [2025-03-08 05:33:51,487 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 9328 transitions. [2025-03-08 05:33:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:33:51,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:51,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:33:51,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:33:51,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:51,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:51,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1206508755, now seen corresponding path program 1 times [2025-03-08 05:33:51,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:51,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852286483] [2025-03-08 05:33:51,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:51,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:51,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:33:51,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:33:51,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:51,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:33:51,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:51,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852286483] [2025-03-08 05:33:51,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852286483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:51,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:51,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:51,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792039259] [2025-03-08 05:33:51,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:51,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:51,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:51,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:51,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:51,571 INFO L87 Difference]: Start difference. First operand 5347 states and 9328 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:51,781 INFO L93 Difference]: Finished difference Result 12525 states and 22064 transitions. [2025-03-08 05:33:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:51,782 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-03-08 05:33:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:51,825 INFO L225 Difference]: With dead ends: 12525 [2025-03-08 05:33:51,826 INFO L226 Difference]: Without dead ends: 8063 [2025-03-08 05:33:51,839 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:33:51,840 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 93 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 779 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:33:51,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 779 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8063 states. [2025-03-08 05:33:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8063 to 8031. [2025-03-08 05:33:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8031 states, 6384 states have (on average 1.6541353383458646) internal successors, (10560), 6393 states have internal predecessors, (10560), 1566 states have call successors, (1566), 69 states have call predecessors, (1566), 80 states have return successors, (2010), 1568 states have call predecessors, (2010), 1562 states have call successors, (2010) [2025-03-08 05:33:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8031 states to 8031 states and 14136 transitions. [2025-03-08 05:33:52,195 INFO L78 Accepts]: Start accepts. Automaton has 8031 states and 14136 transitions. Word has length 111 [2025-03-08 05:33:52,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:52,196 INFO L471 AbstractCegarLoop]: Abstraction has 8031 states and 14136 transitions. [2025-03-08 05:33:52,196 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 8031 states and 14136 transitions. [2025-03-08 05:33:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:33:52,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:52,231 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:33:52,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:33:52,231 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:52,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:52,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2130906063, now seen corresponding path program 1 times [2025-03-08 05:33:52,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:52,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641700495] [2025-03-08 05:33:52,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:52,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:52,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:33:52,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:33:52,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:52,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:33:52,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:52,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641700495] [2025-03-08 05:33:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641700495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:52,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396167429] [2025-03-08 05:33:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:52,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:52,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:52,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:52,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:52,282 INFO L87 Difference]: Start difference. First operand 8031 states and 14136 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:52,612 INFO L93 Difference]: Finished difference Result 18693 states and 33224 transitions. [2025-03-08 05:33:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:52,613 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-08 05:33:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:52,672 INFO L225 Difference]: With dead ends: 18693 [2025-03-08 05:33:52,673 INFO L226 Difference]: Without dead ends: 12319 [2025-03-08 05:33:52,705 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:33:52,705 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 91 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 779 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:33:52,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 779 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12319 states. [2025-03-08 05:33:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12319 to 12287. [2025-03-08 05:33:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12287 states, 9924 states have (on average 1.6590084643288996) internal successors, (16464), 9933 states have internal predecessors, (16464), 2282 states have call successors, (2282), 69 states have call predecessors, (2282), 80 states have return successors, (3006), 2284 states have call predecessors, (3006), 2278 states have call successors, (3006) [2025-03-08 05:33:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12287 states to 12287 states and 21752 transitions. [2025-03-08 05:33:53,254 INFO L78 Accepts]: Start accepts. Automaton has 12287 states and 21752 transitions. Word has length 112 [2025-03-08 05:33:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:53,255 INFO L471 AbstractCegarLoop]: Abstraction has 12287 states and 21752 transitions. [2025-03-08 05:33:53,255 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 12287 states and 21752 transitions. [2025-03-08 05:33:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:33:53,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:53,296 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:33:53,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:33:53,297 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:53,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 972276910, now seen corresponding path program 1 times [2025-03-08 05:33:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391623036] [2025-03-08 05:33:53,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:53,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:33:53,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:33:53,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:53,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:33:53,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:53,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391623036] [2025-03-08 05:33:53,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391623036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:53,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:53,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067210089] [2025-03-08 05:33:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:53,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:53,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:53,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:53,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:53,438 INFO L87 Difference]: Start difference. First operand 12287 states and 21752 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:53,850 INFO L93 Difference]: Finished difference Result 29833 states and 53176 transitions. [2025-03-08 05:33:53,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:53,850 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-03-08 05:33:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:53,927 INFO L225 Difference]: With dead ends: 29833 [2025-03-08 05:33:53,927 INFO L226 Difference]: Without dead ends: 20067 [2025-03-08 05:33:53,951 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:33:53,952 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 89 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 799 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:33:53,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 799 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20067 states. [2025-03-08 05:33:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20067 to 20035. [2025-03-08 05:33:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20035 states, 16168 states have (on average 1.6511627906976745) internal successors, (26696), 16177 states have internal predecessors, (26696), 3786 states have call successors, (3786), 69 states have call predecessors, (3786), 80 states have return successors, (4998), 3788 states have call predecessors, (4998), 3782 states have call successors, (4998) [2025-03-08 05:33:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20035 states to 20035 states and 35480 transitions. [2025-03-08 05:33:54,838 INFO L78 Accepts]: Start accepts. Automaton has 20035 states and 35480 transitions. Word has length 113 [2025-03-08 05:33:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:54,839 INFO L471 AbstractCegarLoop]: Abstraction has 20035 states and 35480 transitions. [2025-03-08 05:33:54,839 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 20035 states and 35480 transitions. [2025-03-08 05:33:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:33:54,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:54,890 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2025-03-08 05:33:54,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:33:54,890 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:54,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:54,891 INFO L85 PathProgramCache]: Analyzing trace with hash 818103374, now seen corresponding path program 1 times [2025-03-08 05:33:54,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:54,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691480688] [2025-03-08 05:33:54,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:54,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:54,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:33:54,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:33:54,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:54,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:33:54,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691480688] [2025-03-08 05:33:54,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691480688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:54,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:54,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114133399] [2025-03-08 05:33:54,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:54,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:54,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:54,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:54,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:54,947 INFO L87 Difference]: Start difference. First operand 20035 states and 35480 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:55,725 INFO L93 Difference]: Finished difference Result 49449 states and 87928 transitions. [2025-03-08 05:33:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:55,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2025-03-08 05:33:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:55,867 INFO L225 Difference]: With dead ends: 49449 [2025-03-08 05:33:55,867 INFO L226 Difference]: Without dead ends: 33355 [2025-03-08 05:33:55,918 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:33:55,919 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 87 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 782 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:33:55,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 782 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33355 states. [2025-03-08 05:33:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33355 to 33323. [2025-03-08 05:33:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33323 states, 27032 states have (on average 1.648712636874815) internal successors, (44568), 27041 states have internal predecessors, (44568), 6210 states have call successors, (6210), 69 states have call predecessors, (6210), 80 states have return successors, (8022), 6212 states have call predecessors, (8022), 6206 states have call successors, (8022) [2025-03-08 05:33:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33323 states to 33323 states and 58800 transitions. [2025-03-08 05:33:57,049 INFO L78 Accepts]: Start accepts. Automaton has 33323 states and 58800 transitions. Word has length 114 [2025-03-08 05:33:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:57,049 INFO L471 AbstractCegarLoop]: Abstraction has 33323 states and 58800 transitions. [2025-03-08 05:33:57,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 33323 states and 58800 transitions. [2025-03-08 05:33:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:33:57,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:57,103 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2025-03-08 05:33:57,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:33:57,103 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:57,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash -464487793, now seen corresponding path program 1 times [2025-03-08 05:33:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:57,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741700151] [2025-03-08 05:33:57,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:57,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:33:57,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:33:57,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:57,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:33:57,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:57,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741700151] [2025-03-08 05:33:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741700151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:57,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:57,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:57,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244779267] [2025-03-08 05:33:57,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:57,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:57,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:57,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:57,151 INFO L87 Difference]: Start difference. First operand 33323 states and 58800 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:33:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:58,657 INFO L93 Difference]: Finished difference Result 86325 states and 152992 transitions. [2025-03-08 05:33:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-03-08 05:33:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:58,910 INFO L225 Difference]: With dead ends: 86325 [2025-03-08 05:33:58,910 INFO L226 Difference]: Without dead ends: 58515 [2025-03-08 05:33:58,980 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:33:58,980 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 85 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 802 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:33:58,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 802 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58515 states. [2025-03-08 05:34:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58515 to 58483. [2025-03-08 05:34:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58483 states, 47380 states have (on average 1.6382439848037147) internal successors, (77620), 47389 states have internal predecessors, (77620), 11022 states have call successors, (11022), 69 states have call predecessors, (11022), 80 states have return successors, (14246), 11024 states have call predecessors, (14246), 11018 states have call successors, (14246) [2025-03-08 05:34:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58483 states to 58483 states and 102888 transitions. [2025-03-08 05:34:01,130 INFO L78 Accepts]: Start accepts. Automaton has 58483 states and 102888 transitions. Word has length 115 [2025-03-08 05:34:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:01,131 INFO L471 AbstractCegarLoop]: Abstraction has 58483 states and 102888 transitions. [2025-03-08 05:34:01,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:34:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 58483 states and 102888 transitions. [2025-03-08 05:34:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:34:01,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:01,209 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2025-03-08 05:34:01,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:34:01,210 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:01,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash -290110451, now seen corresponding path program 1 times [2025-03-08 05:34:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278140469] [2025-03-08 05:34:01,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:01,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:34:01,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:34:01,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:01,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:01,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:01,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278140469] [2025-03-08 05:34:01,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278140469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:01,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:01,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039833198] [2025-03-08 05:34:01,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:01,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:01,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:01,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:01,255 INFO L87 Difference]: Start difference. First operand 58483 states and 102888 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:34:03,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:03,991 INFO L93 Difference]: Finished difference Result 154809 states and 273844 transitions. [2025-03-08 05:34:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:03,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2025-03-08 05:34:03,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:04,545 INFO L225 Difference]: With dead ends: 154809 [2025-03-08 05:34:04,545 INFO L226 Difference]: Without dead ends: 104119 [2025-03-08 05:34:04,749 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:34:04,749 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 83 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 782 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:34:04,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 782 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104119 states. [2025-03-08 05:34:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104119 to 104087. [2025-03-08 05:34:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104087 states, 84828 states have (on average 1.6336115433583251) internal successors, (138576), 84837 states have internal predecessors, (138576), 19178 states have call successors, (19178), 69 states have call predecessors, (19178), 80 states have return successors, (25110), 19180 states have call predecessors, (25110), 19174 states have call successors, (25110) [2025-03-08 05:34:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104087 states to 104087 states and 182864 transitions. [2025-03-08 05:34:08,920 INFO L78 Accepts]: Start accepts. Automaton has 104087 states and 182864 transitions. Word has length 116 [2025-03-08 05:34:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:08,920 INFO L471 AbstractCegarLoop]: Abstraction has 104087 states and 182864 transitions. [2025-03-08 05:34:08,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:34:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 104087 states and 182864 transitions. [2025-03-08 05:34:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:34:09,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:09,040 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2025-03-08 05:34:09,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:34:09,040 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:09,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1727563609, now seen corresponding path program 2 times [2025-03-08 05:34:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924137115] [2025-03-08 05:34:09,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:34:09,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:09,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-08 05:34:09,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 117 statements. [2025-03-08 05:34:09,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:34:09,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 05:34:09,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924137115] [2025-03-08 05:34:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924137115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:09,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:09,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132271668] [2025-03-08 05:34:09,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:09,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:09,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:09,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:09,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:09,550 INFO L87 Difference]: Start difference. First operand 104087 states and 182864 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:34:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:13,023 INFO L93 Difference]: Finished difference Result 208171 states and 371636 transitions. [2025-03-08 05:34:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:34:13,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2025-03-08 05:34:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:14,122 INFO L225 Difference]: With dead ends: 208171 [2025-03-08 05:34:14,122 INFO L226 Difference]: Without dead ends: 208169 [2025-03-08 05:34:14,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:34:14,204 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 359 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:14,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 2738 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:34:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208169 states.