./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product18.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_spec27_product18.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a1a15d818854b6fd39e860ed8f86805463715275e4ae9feedab248e5877daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:32:01,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:32:01,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:32:01,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:32:01,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:32:01,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:32:01,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:32:01,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:32:01,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:32:01,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:32:01,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:32:01,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:32:01,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:32:01,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:32:01,926 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:32:01,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:32:01,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:32:01,926 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:32:01,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:32:01,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:32:01,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:01,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:32:01,927 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:32:01,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:32:01,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:32:01,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:32:01,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:32:01,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:32:01,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:32:01,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:32:01,929 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 -> e1a1a15d818854b6fd39e860ed8f86805463715275e4ae9feedab248e5877daf [2025-03-08 05:32:02,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:32:02,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:32:02,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:32:02,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:32:02,251 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:32:02,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product18.cil.c [2025-03-08 05:32:03,535 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cfa2985/33ef1a97581343b5abcbd20c44ecc88f/FLAGca89d011e [2025-03-08 05:32:03,887 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:32:03,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product18.cil.c [2025-03-08 05:32:03,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cfa2985/33ef1a97581343b5abcbd20c44ecc88f/FLAGca89d011e [2025-03-08 05:32:04,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cfa2985/33ef1a97581343b5abcbd20c44ecc88f [2025-03-08 05:32:04,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:32:04,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:32:04,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:04,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:32:04,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:32:04,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a8e7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04, skipping insertion in model container [2025-03-08 05:32:04,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:32:04,631 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_spec27_product18.cil.c[62382,62395] [2025-03-08 05:32:04,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:04,649 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:32:04,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-08 05:32:04,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [363] [2025-03-08 05:32:04,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [729] [2025-03-08 05:32:04,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1801] [2025-03-08 05:32:04,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1908] [2025-03-08 05:32:04,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1925] [2025-03-08 05:32:04,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2329] [2025-03-08 05:32:04,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2545] [2025-03-08 05:32:04,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2831] [2025-03-08 05:32:04,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2863] [2025-03-08 05:32:04,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2898] [2025-03-08 05:32:04,753 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_spec27_product18.cil.c[62382,62395] [2025-03-08 05:32:04,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:04,780 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:32:04,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04 WrapperNode [2025-03-08 05:32:04,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:04,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:04,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:32:04,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:32:04,793 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:32:04" (1/1) ... [2025-03-08 05:32:04,812 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:32:04" (1/1) ... [2025-03-08 05:32:04,861 INFO L138 Inliner]: procedures = 127, calls = 186, calls flagged for inlining = 57, calls inlined = 49, statements flattened = 874 [2025-03-08 05:32:04,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:04,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:32:04,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:32:04,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:32:04,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,907 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:32:04,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:32:04,937 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:32:04,937 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:32:04,938 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:32:04,938 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 05:32:04,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:04,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:04,969 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:32:04,975 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:32:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:32:04,993 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:32:04,993 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:32:04,993 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:32:04,993 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:32:04,993 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:32:04,993 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:32:04,993 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:32:04,993 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:32:04,993 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:32:04,993 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:32:04,993 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:32:04,994 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:32:04,994 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:32:04,994 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:32:04,994 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:32:04,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:32:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:32:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:32:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:32:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:32:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:32:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:32:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:32:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:32:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-08 05:32:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-08 05:32:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:32:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:32:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:32:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:32:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:32:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:32:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:32:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:32:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:32:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:32:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:32:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:32:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:32:05,000 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:32:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:32:05,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:32:05,154 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:32:05,156 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:32:05,193 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2273: #res := ~retValue_acc~34; [2025-03-08 05:32:05,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1778-1: getClientId_#res#1 := getClientId_~retValue_acc~20#1; [2025-03-08 05:32:05,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1343-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~13#1; [2025-03-08 05:32:05,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1296-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~12#1; [2025-03-08 05:32:05,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~40#1; [2025-03-08 05:32:05,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2236: #res := ~retValue_acc~33; [2025-03-08 05:32:05,444 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2310: #res := ~retValue_acc~35; [2025-03-08 05:32:05,455 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2047: #res := ~retValue_acc~28; [2025-03-08 05:32:05,506 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1435: #res#1 := ~retValue_acc~15#1; [2025-03-08 05:32:05,507 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1390-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~14#1; [2025-03-08 05:32:05,534 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1659: #res := ~retValue_acc~18; [2025-03-08 05:32:05,565 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-1: createEmail_#res#1 := createEmail_~retValue_acc~23#1; [2025-03-08 05:32:05,769 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1605-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~17#1; [2025-03-08 05:32:05,769 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~16#1; [2025-03-08 05:32:05,769 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2895-1: valid_product_#res#1 := valid_product_~retValue_acc~42#1; [2025-03-08 05:32:05,769 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2691-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~37#1; [2025-03-08 05:32:05,769 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2700-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~38#1; [2025-03-08 05:32:05,769 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2709-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~39#1; [2025-03-08 05:32:05,777 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2010: #res := ~retValue_acc~27; [2025-03-08 05:32:05,782 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: #res := ~retValue_acc~21; [2025-03-08 05:32:05,880 INFO L? ?]: Removed 399 outVars from TransFormulas that were not future-live. [2025-03-08 05:32:05,881 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:32:05,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:32:05,900 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:32:05,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:05 BoogieIcfgContainer [2025-03-08 05:32:05,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:32:05,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:32:05,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:32:05,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:32:05,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:32:04" (1/3) ... [2025-03-08 05:32:05,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc8c6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:05, skipping insertion in model container [2025-03-08 05:32:05,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (2/3) ... [2025-03-08 05:32:05,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc8c6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:05, skipping insertion in model container [2025-03-08 05:32:05,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:05" (3/3) ... [2025-03-08 05:32:05,909 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product18.cil.c [2025-03-08 05:32:05,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:32:05,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product18.cil.c that has 19 procedures, 296 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:32:05,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:32:05,982 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;@129a8fbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:32:05,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:32:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 235 states have (on average 1.5404255319148936) internal successors, (362), 237 states have internal predecessors, (362), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 05:32:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:32:05,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:05,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:05,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:06,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1174649971, now seen corresponding path program 1 times [2025-03-08 05:32:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121250227] [2025-03-08 05:32:06,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:06,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:32:06,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:32:06,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:06,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:32:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:06,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121250227] [2025-03-08 05:32:06,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121250227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:06,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403963004] [2025-03-08 05:32:06,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:06,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:06,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:06,608 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:32:06,642 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:32:06,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:32:06,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:32:06,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:06,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:06,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 05:32:06,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:32:06,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:06,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403963004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:06,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:06,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-08 05:32:06,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882309547] [2025-03-08 05:32:06,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:06,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:32:06,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:06,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:32:06,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:06,976 INFO L87 Difference]: Start difference. First operand has 296 states, 235 states have (on average 1.5404255319148936) internal successors, (362), 237 states have internal predecessors, (362), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:07,020 INFO L93 Difference]: Finished difference Result 440 states and 645 transitions. [2025-03-08 05:32:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:32:07,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2025-03-08 05:32:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:07,029 INFO L225 Difference]: With dead ends: 440 [2025-03-08 05:32:07,029 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 05:32:07,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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:32:07,036 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:07,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 05:32:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-03-08 05:32:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 229 states have (on average 1.537117903930131) internal successors, (352), 230 states have internal predecessors, (352), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 05:32:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 433 transitions. [2025-03-08 05:32:07,082 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 433 transitions. Word has length 108 [2025-03-08 05:32:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:07,083 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 433 transitions. [2025-03-08 05:32:07,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 433 transitions. [2025-03-08 05:32:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:32:07,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:07,087 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:07,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:07,291 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:32:07,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:07,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash 511529867, now seen corresponding path program 1 times [2025-03-08 05:32:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465611697] [2025-03-08 05:32:07,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:07,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:32:07,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:32:07,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:07,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:32:07,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:07,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465611697] [2025-03-08 05:32:07,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465611697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:07,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502084489] [2025-03-08 05:32:07,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:07,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:07,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:07,518 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:32:07,519 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:32:07,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:32:07,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:32:07,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:07,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:07,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:32:07,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:32:07,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502084489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:07,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:32:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596907816] [2025-03-08 05:32:07,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:07,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:07,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:07,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:07,809 INFO L87 Difference]: Start difference. First operand 289 states and 433 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:07,844 INFO L93 Difference]: Finished difference Result 428 states and 625 transitions. [2025-03-08 05:32:07,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2025-03-08 05:32:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:07,850 INFO L225 Difference]: With dead ends: 428 [2025-03-08 05:32:07,850 INFO L226 Difference]: Without dead ends: 290 [2025-03-08 05:32:07,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 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:32:07,852 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 0 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:07,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 862 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-08 05:32:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-08 05:32:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 230 states have (on average 1.5347826086956522) internal successors, (353), 231 states have internal predecessors, (353), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 05:32:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 434 transitions. [2025-03-08 05:32:07,893 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 434 transitions. Word has length 108 [2025-03-08 05:32:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:07,893 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 434 transitions. [2025-03-08 05:32:07,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 434 transitions. [2025-03-08 05:32:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:32:07,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:07,896 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:07,907 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:32:08,103 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:32:08,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:08,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1555188688, now seen corresponding path program 1 times [2025-03-08 05:32:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:08,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081646504] [2025-03-08 05:32:08,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:08,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:08,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:32:08,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:32:08,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:08,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:08,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:08,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081646504] [2025-03-08 05:32:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081646504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:08,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804782188] [2025-03-08 05:32:08,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:08,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:08,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:08,312 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:32:08,314 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:32:08,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:32:08,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:32:08,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:08,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:08,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:08,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:32:08,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804782188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:08,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:32:08,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228563305] [2025-03-08 05:32:08,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:08,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:08,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:08,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:08,574 INFO L87 Difference]: Start difference. First operand 290 states and 434 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:08,597 INFO L93 Difference]: Finished difference Result 609 states and 926 transitions. [2025-03-08 05:32:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:08,598 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-03-08 05:32:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:08,600 INFO L225 Difference]: With dead ends: 609 [2025-03-08 05:32:08,600 INFO L226 Difference]: Without dead ends: 345 [2025-03-08 05:32:08,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 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:32:08,602 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 107 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 833 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:32:08,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 833 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-08 05:32:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 337. [2025-03-08 05:32:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 266 states have (on average 1.5526315789473684) internal successors, (413), 267 states have internal predecessors, (413), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 05:32:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 516 transitions. [2025-03-08 05:32:08,622 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 516 transitions. Word has length 115 [2025-03-08 05:32:08,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:08,622 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 516 transitions. [2025-03-08 05:32:08,622 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 516 transitions. [2025-03-08 05:32:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:32:08,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:08,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:08,632 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:32:08,825 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:32:08,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:08,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:08,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1477084896, now seen corresponding path program 1 times [2025-03-08 05:32:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002038409] [2025-03-08 05:32:08,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:08,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:08,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:32:08,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:32:08,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:08,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:09,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:09,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002038409] [2025-03-08 05:32:09,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002038409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:09,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988052794] [2025-03-08 05:32:09,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:09,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:09,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:09,004 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:32:09,006 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:32:09,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:32:09,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:32:09,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:09,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:09,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:32:09,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:32:09,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:09,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988052794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:09,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:09,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:32:09,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321196415] [2025-03-08 05:32:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:09,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:09,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:09,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:09,313 INFO L87 Difference]: Start difference. First operand 337 states and 516 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:09,369 INFO L93 Difference]: Finished difference Result 665 states and 1022 transitions. [2025-03-08 05:32:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:09,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-08 05:32:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:09,374 INFO L225 Difference]: With dead ends: 665 [2025-03-08 05:32:09,375 INFO L226 Difference]: Without dead ends: 339 [2025-03-08 05:32:09,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 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:32:09,376 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 2 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1689 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:32:09,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1689 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-08 05:32:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-03-08 05:32:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 267 states have (on average 1.550561797752809) internal successors, (414), 269 states have internal predecessors, (414), 52 states have call successors, (52), 18 states have call predecessors, (52), 19 states have return successors, (53), 51 states have call predecessors, (53), 51 states have call successors, (53) [2025-03-08 05:32:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 519 transitions. [2025-03-08 05:32:09,394 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 519 transitions. Word has length 116 [2025-03-08 05:32:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:09,394 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 519 transitions. [2025-03-08 05:32:09,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 519 transitions. [2025-03-08 05:32:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:32:09,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:09,397 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:09,408 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:32:09,597 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:32:09,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:09,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1510763625, now seen corresponding path program 1 times [2025-03-08 05:32:09,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:09,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511839979] [2025-03-08 05:32:09,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:09,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:32:09,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:32:09,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:09,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:32:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511839979] [2025-03-08 05:32:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511839979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250230446] [2025-03-08 05:32:09,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:09,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:09,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:09,774 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:32:09,775 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:32:09,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:32:10,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:32:10,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:10,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:10,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:32:10,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:32:10,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:10,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250230446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:10,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:10,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:32:10,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564267460] [2025-03-08 05:32:10,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:10,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:10,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:10,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:10,095 INFO L87 Difference]: Start difference. First operand 339 states and 519 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:10,164 INFO L93 Difference]: Finished difference Result 667 states and 1027 transitions. [2025-03-08 05:32:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:10,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-08 05:32:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:10,168 INFO L225 Difference]: With dead ends: 667 [2025-03-08 05:32:10,168 INFO L226 Difference]: Without dead ends: 341 [2025-03-08 05:32:10,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 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:32:10,171 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 2 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1675 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:32:10,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1675 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-08 05:32:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-03-08 05:32:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 268 states have (on average 1.5485074626865671) internal successors, (415), 271 states have internal predecessors, (415), 52 states have call successors, (52), 18 states have call predecessors, (52), 20 states have return successors, (58), 51 states have call predecessors, (58), 51 states have call successors, (58) [2025-03-08 05:32:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 525 transitions. [2025-03-08 05:32:10,195 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 525 transitions. Word has length 117 [2025-03-08 05:32:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:10,195 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 525 transitions. [2025-03-08 05:32:10,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 525 transitions. [2025-03-08 05:32:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:32:10,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:10,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:10,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:10,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:10,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:10,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2108541297, now seen corresponding path program 1 times [2025-03-08 05:32:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:10,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941910032] [2025-03-08 05:32:10,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:10,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:32:10,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:32:10,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:10,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941910032] [2025-03-08 05:32:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941910032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:10,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:10,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755729797] [2025-03-08 05:32:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:10,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:10,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:10,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:10,589 INFO L87 Difference]: Start difference. First operand 341 states and 525 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:10,651 INFO L93 Difference]: Finished difference Result 659 states and 1018 transitions. [2025-03-08 05:32:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:10,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-03-08 05:32:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:10,655 INFO L225 Difference]: With dead ends: 659 [2025-03-08 05:32:10,655 INFO L226 Difference]: Without dead ends: 341 [2025-03-08 05:32:10,658 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:32:10,658 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 2 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1693 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:32:10,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1693 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-08 05:32:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-03-08 05:32:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 268 states have (on average 1.5485074626865671) internal successors, (415), 271 states have internal predecessors, (415), 52 states have call successors, (52), 18 states have call predecessors, (52), 20 states have return successors, (57), 51 states have call predecessors, (57), 51 states have call successors, (57) [2025-03-08 05:32:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 524 transitions. [2025-03-08 05:32:10,673 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 524 transitions. Word has length 118 [2025-03-08 05:32:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:10,673 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 524 transitions. [2025-03-08 05:32:10,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 524 transitions. [2025-03-08 05:32:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:32:10,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:10,678 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:32:10,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:32:10,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:10,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1455522024, now seen corresponding path program 2 times [2025-03-08 05:32:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484264415] [2025-03-08 05:32:10,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:10,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-03-08 05:32:10,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 119 statements. [2025-03-08 05:32:10,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:32:10,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:10,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:10,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484264415] [2025-03-08 05:32:10,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484264415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:10,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:10,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:32:10,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965756670] [2025-03-08 05:32:10,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:10,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:32:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:10,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:32:10,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:10,784 INFO L87 Difference]: Start difference. First operand 341 states and 524 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:10,818 INFO L93 Difference]: Finished difference Result 471 states and 704 transitions. [2025-03-08 05:32:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:32:10,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-03-08 05:32:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:10,822 INFO L225 Difference]: With dead ends: 471 [2025-03-08 05:32:10,822 INFO L226 Difference]: Without dead ends: 341 [2025-03-08 05:32:10,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:10,824 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 0 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:10,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2559 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-08 05:32:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-03-08 05:32:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 268 states have (on average 1.544776119402985) internal successors, (414), 271 states have internal predecessors, (414), 52 states have call successors, (52), 18 states have call predecessors, (52), 20 states have return successors, (57), 51 states have call predecessors, (57), 51 states have call successors, (57) [2025-03-08 05:32:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 523 transitions. [2025-03-08 05:32:10,849 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 523 transitions. Word has length 119 [2025-03-08 05:32:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:10,849 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 523 transitions. [2025-03-08 05:32:10,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 523 transitions. [2025-03-08 05:32:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:32:10,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:10,853 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:10,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:32:10,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash 29406186, now seen corresponding path program 1 times [2025-03-08 05:32:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570190256] [2025-03-08 05:32:10,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:10,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:32:10,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:32:10,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:10,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:11,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:11,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570190256] [2025-03-08 05:32:11,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570190256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:11,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:11,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:11,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359352421] [2025-03-08 05:32:11,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:11,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:11,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:11,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:11,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:11,006 INFO L87 Difference]: Start difference. First operand 341 states and 523 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:32:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:11,050 INFO L93 Difference]: Finished difference Result 661 states and 1019 transitions. [2025-03-08 05:32:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:11,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2025-03-08 05:32:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:11,055 INFO L225 Difference]: With dead ends: 661 [2025-03-08 05:32:11,056 INFO L226 Difference]: Without dead ends: 343 [2025-03-08 05:32:11,057 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:32:11,058 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 1 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1692 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:32:11,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1692 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-08 05:32:11,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-03-08 05:32:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 269 states have (on average 1.5427509293680297) internal successors, (415), 273 states have internal predecessors, (415), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (59), 51 states have call predecessors, (59), 51 states have call successors, (59) [2025-03-08 05:32:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 526 transitions. [2025-03-08 05:32:11,074 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 526 transitions. Word has length 126 [2025-03-08 05:32:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:11,075 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 526 transitions. [2025-03-08 05:32:11,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:32:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 526 transitions. [2025-03-08 05:32:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:32:11,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:11,077 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:11,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:32:11,077 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:11,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2142356332, now seen corresponding path program 1 times [2025-03-08 05:32:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:11,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665106860] [2025-03-08 05:32:11,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:11,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:32:11,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:32:11,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:11,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:32:11,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:11,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665106860] [2025-03-08 05:32:11,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665106860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:11,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:11,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:11,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120796969] [2025-03-08 05:32:11,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:11,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:11,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:11,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:11,234 INFO L87 Difference]: Start difference. First operand 343 states and 526 transitions. Second operand has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:32:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:11,370 INFO L93 Difference]: Finished difference Result 663 states and 1018 transitions. [2025-03-08 05:32:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:32:11,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 127 [2025-03-08 05:32:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:11,374 INFO L225 Difference]: With dead ends: 663 [2025-03-08 05:32:11,374 INFO L226 Difference]: Without dead ends: 345 [2025-03-08 05:32:11,376 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:32:11,376 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 7 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2883 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:32:11,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2883 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-08 05:32:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-08 05:32:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 271 states have (on average 1.5387453874538746) internal successors, (417), 274 states have internal predecessors, (417), 52 states have call successors, (52), 19 states have call predecessors, (52), 21 states have return successors, (58), 51 states have call predecessors, (58), 51 states have call successors, (58) [2025-03-08 05:32:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 527 transitions. [2025-03-08 05:32:11,394 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 527 transitions. Word has length 127 [2025-03-08 05:32:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:11,394 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 527 transitions. [2025-03-08 05:32:11,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:32:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 527 transitions. [2025-03-08 05:32:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:32:11,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:11,396 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:11,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:32:11,396 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:11,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash -350193254, now seen corresponding path program 2 times [2025-03-08 05:32:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:11,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401680905] [2025-03-08 05:32:11,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:11,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:11,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-03-08 05:32:11,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:32:11,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:32:11,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:32:11,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:11,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401680905] [2025-03-08 05:32:11,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401680905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:11,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:11,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:32:11,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293804318] [2025-03-08 05:32:11,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:11,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:32:11,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:11,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:32:11,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:11,548 INFO L87 Difference]: Start difference. First operand 345 states and 527 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:32:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:11,611 INFO L93 Difference]: Finished difference Result 663 states and 1022 transitions. [2025-03-08 05:32:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:32:11,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2025-03-08 05:32:11,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:11,614 INFO L225 Difference]: With dead ends: 663 [2025-03-08 05:32:11,614 INFO L226 Difference]: Without dead ends: 347 [2025-03-08 05:32:11,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:11,615 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 2 mSDsluCounter, 2092 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:11,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2516 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-08 05:32:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-03-08 05:32:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 272 states have (on average 1.536764705882353) internal successors, (418), 276 states have internal predecessors, (418), 52 states have call successors, (52), 19 states have call predecessors, (52), 22 states have return successors, (63), 51 states have call predecessors, (63), 51 states have call successors, (63) [2025-03-08 05:32:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 533 transitions. [2025-03-08 05:32:11,626 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 533 transitions. Word has length 128 [2025-03-08 05:32:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:11,626 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 533 transitions. [2025-03-08 05:32:11,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:32:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 533 transitions. [2025-03-08 05:32:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:32:11,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:11,628 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:11,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:32:11,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:11,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash 121619863, now seen corresponding path program 1 times [2025-03-08 05:32:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:11,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815335956] [2025-03-08 05:32:11,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:11,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:32:11,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:32:11,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:11,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:11,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815335956] [2025-03-08 05:32:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815335956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105326669] [2025-03-08 05:32:11,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:11,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:11,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:11,773 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:32:11,774 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:32:11,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:32:12,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:32:12,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:12,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:12,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:12,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:12,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:32:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:12,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105326669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:32:12,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:32:12,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:32:12,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648156328] [2025-03-08 05:32:12,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:32:12,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:32:12,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:12,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:32:12,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:12,135 INFO L87 Difference]: Start difference. First operand 347 states and 533 transitions. Second operand has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-08 05:32:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:12,612 INFO L93 Difference]: Finished difference Result 1007 states and 1624 transitions. [2025-03-08 05:32:12,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:32:12,612 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 129 [2025-03-08 05:32:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:12,616 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 05:32:12,616 INFO L226 Difference]: Without dead ends: 690 [2025-03-08 05:32:12,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:32:12,618 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 1101 mSDsluCounter, 2895 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:12,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 3318 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:32:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-08 05:32:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 664. [2025-03-08 05:32:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 525 states have (on average 1.5961904761904762) internal successors, (838), 529 states have internal predecessors, (838), 116 states have call successors, (116), 19 states have call predecessors, (116), 22 states have return successors, (137), 115 states have call predecessors, (137), 115 states have call successors, (137) [2025-03-08 05:32:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1091 transitions. [2025-03-08 05:32:12,652 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1091 transitions. Word has length 129 [2025-03-08 05:32:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:12,652 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 1091 transitions. [2025-03-08 05:32:12,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-08 05:32:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1091 transitions. [2025-03-08 05:32:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:32:12,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:12,656 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:12,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:12,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:12,857 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:12,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:12,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1613800207, now seen corresponding path program 1 times [2025-03-08 05:32:12,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:12,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780626955] [2025-03-08 05:32:12,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:12,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:32:12,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:32:12,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:12,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780626955] [2025-03-08 05:32:12,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780626955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:12,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:12,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041333420] [2025-03-08 05:32:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:12,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:12,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:12,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:12,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:12,938 INFO L87 Difference]: Start difference. First operand 664 states and 1091 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:12,973 INFO L93 Difference]: Finished difference Result 1548 states and 2590 transitions. [2025-03-08 05:32:12,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:12,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-03-08 05:32:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:12,982 INFO L225 Difference]: With dead ends: 1548 [2025-03-08 05:32:12,982 INFO L226 Difference]: Without dead ends: 960 [2025-03-08 05:32:12,984 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:32:12,984 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 104 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 862 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:32:12,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 862 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-08 05:32:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 952. [2025-03-08 05:32:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 749 states have (on average 1.6168224299065421) internal successors, (1211), 753 states have internal predecessors, (1211), 180 states have call successors, (180), 19 states have call predecessors, (180), 22 states have return successors, (211), 179 states have call predecessors, (211), 179 states have call successors, (211) [2025-03-08 05:32:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1602 transitions. [2025-03-08 05:32:13,032 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1602 transitions. Word has length 133 [2025-03-08 05:32:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:13,032 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1602 transitions. [2025-03-08 05:32:13,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1602 transitions. [2025-03-08 05:32:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:32:13,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,039 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:32:13,039 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1921176010, now seen corresponding path program 1 times [2025-03-08 05:32:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987247461] [2025-03-08 05:32:13,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:32:13,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:32:13,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:13,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:13,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987247461] [2025-03-08 05:32:13,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987247461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:13,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:13,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:13,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567317190] [2025-03-08 05:32:13,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:13,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:13,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:13,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:13,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:13,098 INFO L87 Difference]: Start difference. First operand 952 states and 1602 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:13,160 INFO L93 Difference]: Finished difference Result 2260 states and 3826 transitions. [2025-03-08 05:32:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:13,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-08 05:32:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:13,168 INFO L225 Difference]: With dead ends: 2260 [2025-03-08 05:32:13,169 INFO L226 Difference]: Without dead ends: 1433 [2025-03-08 05:32:13,172 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:32:13,172 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 102 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 856 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:32:13,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 856 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-03-08 05:32:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1425. [2025-03-08 05:32:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1127 states have (on average 1.626441881100266) internal successors, (1833), 1131 states have internal predecessors, (1833), 275 states have call successors, (275), 19 states have call predecessors, (275), 22 states have return successors, (306), 274 states have call predecessors, (306), 274 states have call successors, (306) [2025-03-08 05:32:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2414 transitions. [2025-03-08 05:32:13,248 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2414 transitions. Word has length 134 [2025-03-08 05:32:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:13,248 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 2414 transitions. [2025-03-08 05:32:13,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2414 transitions. [2025-03-08 05:32:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:32:13,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,256 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:32:13,256 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 544026802, now seen corresponding path program 1 times [2025-03-08 05:32:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278447621] [2025-03-08 05:32:13,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:32:13,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:32:13,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:13,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:13,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278447621] [2025-03-08 05:32:13,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278447621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:13,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:13,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:13,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877589301] [2025-03-08 05:32:13,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:13,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:13,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:13,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:13,313 INFO L87 Difference]: Start difference. First operand 1425 states and 2414 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:13,397 INFO L93 Difference]: Finished difference Result 3316 states and 5664 transitions. [2025-03-08 05:32:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:13,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-08 05:32:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:13,409 INFO L225 Difference]: With dead ends: 3316 [2025-03-08 05:32:13,409 INFO L226 Difference]: Without dead ends: 2144 [2025-03-08 05:32:13,413 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:32:13,414 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 100 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 851 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:32:13,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 851 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2025-03-08 05:32:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 2136. [2025-03-08 05:32:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 1715 states have (on average 1.634402332361516) internal successors, (2803), 1719 states have internal predecessors, (2803), 398 states have call successors, (398), 19 states have call predecessors, (398), 22 states have return successors, (445), 397 states have call predecessors, (445), 397 states have call successors, (445) [2025-03-08 05:32:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 3646 transitions. [2025-03-08 05:32:13,513 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 3646 transitions. Word has length 135 [2025-03-08 05:32:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:13,513 INFO L471 AbstractCegarLoop]: Abstraction has 2136 states and 3646 transitions. [2025-03-08 05:32:13,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 3646 transitions. [2025-03-08 05:32:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:32:13,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,523 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:32:13,523 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash 279487701, now seen corresponding path program 1 times [2025-03-08 05:32:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940215895] [2025-03-08 05:32:13,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:32:13,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:32:13,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:13,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:13,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940215895] [2025-03-08 05:32:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940215895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:13,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340911502] [2025-03-08 05:32:13,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:13,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:13,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:13,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:13,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:13,594 INFO L87 Difference]: Start difference. First operand 2136 states and 3646 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:13,686 INFO L93 Difference]: Finished difference Result 4948 states and 8510 transitions. [2025-03-08 05:32:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:13,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-08 05:32:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:13,705 INFO L225 Difference]: With dead ends: 4948 [2025-03-08 05:32:13,705 INFO L226 Difference]: Without dead ends: 3273 [2025-03-08 05:32:13,712 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:32:13,713 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 98 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 851 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:32:13,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 851 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2025-03-08 05:32:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3265. [2025-03-08 05:32:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3265 states, 2665 states have (on average 1.6397748592870545) internal successors, (4370), 2669 states have internal predecessors, (4370), 577 states have call successors, (577), 19 states have call predecessors, (577), 22 states have return successors, (650), 576 states have call predecessors, (650), 576 states have call successors, (650) [2025-03-08 05:32:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 5597 transitions. [2025-03-08 05:32:13,932 INFO L78 Accepts]: Start accepts. Automaton has 3265 states and 5597 transitions. Word has length 136 [2025-03-08 05:32:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:13,933 INFO L471 AbstractCegarLoop]: Abstraction has 3265 states and 5597 transitions. [2025-03-08 05:32:13,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3265 states and 5597 transitions. [2025-03-08 05:32:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:32:13,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,955 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:32:13,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash 919129939, now seen corresponding path program 1 times [2025-03-08 05:32:13,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416316313] [2025-03-08 05:32:13,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:32:13,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:32:13,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:14,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416316313] [2025-03-08 05:32:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416316313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:14,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:14,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603164320] [2025-03-08 05:32:14,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:14,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:14,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:14,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:14,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:14,025 INFO L87 Difference]: Start difference. First operand 3265 states and 5597 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:14,174 INFO L93 Difference]: Finished difference Result 7888 states and 13593 transitions. [2025-03-08 05:32:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:14,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-08 05:32:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:14,204 INFO L225 Difference]: With dead ends: 7888 [2025-03-08 05:32:14,204 INFO L226 Difference]: Without dead ends: 5320 [2025-03-08 05:32:14,214 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:32:14,215 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 96 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 867 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:32:14,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 867 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2025-03-08 05:32:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 5312. [2025-03-08 05:32:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5312 states, 4336 states have (on average 1.6333025830258303) internal successors, (7082), 4340 states have internal predecessors, (7082), 953 states have call successors, (953), 19 states have call predecessors, (953), 22 states have return successors, (1070), 952 states have call predecessors, (1070), 952 states have call successors, (1070) [2025-03-08 05:32:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5312 states to 5312 states and 9105 transitions. [2025-03-08 05:32:14,502 INFO L78 Accepts]: Start accepts. Automaton has 5312 states and 9105 transitions. Word has length 137 [2025-03-08 05:32:14,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:14,502 INFO L471 AbstractCegarLoop]: Abstraction has 5312 states and 9105 transitions. [2025-03-08 05:32:14,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5312 states and 9105 transitions. [2025-03-08 05:32:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:32:14,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:14,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:14,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:32:14,524 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:14,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1606607924, now seen corresponding path program 1 times [2025-03-08 05:32:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:14,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229516453] [2025-03-08 05:32:14,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:14,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:14,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:32:14,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:32:14,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:14,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:14,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:14,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229516453] [2025-03-08 05:32:14,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229516453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:14,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:14,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750684358] [2025-03-08 05:32:14,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:14,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:14,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:14,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:14,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:14,596 INFO L87 Difference]: Start difference. First operand 5312 states and 9105 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:14,855 INFO L93 Difference]: Finished difference Result 13072 states and 22545 transitions. [2025-03-08 05:32:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:14,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-08 05:32:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:14,910 INFO L225 Difference]: With dead ends: 13072 [2025-03-08 05:32:14,911 INFO L226 Difference]: Without dead ends: 8837 [2025-03-08 05:32:14,930 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:32:14,930 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 94 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 858 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:32:14,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 858 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8837 states. [2025-03-08 05:32:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8837 to 8829. [2025-03-08 05:32:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8829 states, 7247 states have (on average 1.6314336967020837) internal successors, (11823), 7251 states have internal predecessors, (11823), 1559 states have call successors, (1559), 19 states have call predecessors, (1559), 22 states have return successors, (1754), 1558 states have call predecessors, (1754), 1558 states have call successors, (1754) [2025-03-08 05:32:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8829 states to 8829 states and 15136 transitions. [2025-03-08 05:32:15,353 INFO L78 Accepts]: Start accepts. Automaton has 8829 states and 15136 transitions. Word has length 138 [2025-03-08 05:32:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:15,353 INFO L471 AbstractCegarLoop]: Abstraction has 8829 states and 15136 transitions. [2025-03-08 05:32:15,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 8829 states and 15136 transitions. [2025-03-08 05:32:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:32:15,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:15,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:15,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:32:15,383 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:15,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash 989387348, now seen corresponding path program 1 times [2025-03-08 05:32:15,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:15,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879644087] [2025-03-08 05:32:15,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:15,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:15,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:32:15,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:32:15,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:15,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:15,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:15,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879644087] [2025-03-08 05:32:15,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879644087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:15,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:15,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:15,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974698821] [2025-03-08 05:32:15,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:15,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:15,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:15,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:15,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:15,443 INFO L87 Difference]: Start difference. First operand 8829 states and 15136 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:15,750 INFO L93 Difference]: Finished difference Result 22816 states and 39265 transitions. [2025-03-08 05:32:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:15,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-03-08 05:32:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:15,810 INFO L225 Difference]: With dead ends: 22816 [2025-03-08 05:32:15,810 INFO L226 Difference]: Without dead ends: 15487 [2025-03-08 05:32:15,838 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:32:15,839 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 92 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 875 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:32:15,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 875 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15487 states. [2025-03-08 05:32:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15487 to 15479. [2025-03-08 05:32:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15479 states, 12694 states have (on average 1.6220261540885457) internal successors, (20590), 12698 states have internal predecessors, (20590), 2762 states have call successors, (2762), 19 states have call predecessors, (2762), 22 states have return successors, (3101), 2761 states have call predecessors, (3101), 2761 states have call successors, (3101) [2025-03-08 05:32:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15479 states to 15479 states and 26453 transitions. [2025-03-08 05:32:16,425 INFO L78 Accepts]: Start accepts. Automaton has 15479 states and 26453 transitions. Word has length 139 [2025-03-08 05:32:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:16,426 INFO L471 AbstractCegarLoop]: Abstraction has 15479 states and 26453 transitions. [2025-03-08 05:32:16,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 15479 states and 26453 transitions. [2025-03-08 05:32:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:32:16,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:16,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:16,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:32:16,582 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:16,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash 475509459, now seen corresponding path program 1 times [2025-03-08 05:32:16,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:16,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959862210] [2025-03-08 05:32:16,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:16,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:16,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:32:16,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:32:16,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:16,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:16,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:16,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959862210] [2025-03-08 05:32:16,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959862210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:16,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:16,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:16,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053633498] [2025-03-08 05:32:16,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:16,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:16,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:16,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:16,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:16,640 INFO L87 Difference]: Start difference. First operand 15479 states and 26453 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:17,380 INFO L93 Difference]: Finished difference Result 40947 states and 70287 transitions. [2025-03-08 05:32:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:17,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-03-08 05:32:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:17,479 INFO L225 Difference]: With dead ends: 40947 [2025-03-08 05:32:17,480 INFO L226 Difference]: Without dead ends: 27573 [2025-03-08 05:32:17,515 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:32:17,516 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 90 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 854 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:32:17,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 854 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27573 states. [2025-03-08 05:32:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27573 to 27565. [2025-03-08 05:32:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27565 states, 22741 states have (on average 1.6176949122729871) internal successors, (36788), 22745 states have internal predecessors, (36788), 4801 states have call successors, (4801), 19 states have call predecessors, (4801), 22 states have return successors, (5414), 4800 states have call predecessors, (5414), 4800 states have call successors, (5414) [2025-03-08 05:32:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27565 states to 27565 states and 47003 transitions. [2025-03-08 05:32:18,387 INFO L78 Accepts]: Start accepts. Automaton has 27565 states and 47003 transitions. Word has length 140 [2025-03-08 05:32:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:18,388 INFO L471 AbstractCegarLoop]: Abstraction has 27565 states and 47003 transitions. [2025-03-08 05:32:18,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 27565 states and 47003 transitions. [2025-03-08 05:32:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:32:18,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:18,437 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:18,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:32:18,437 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:18,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:18,438 INFO L85 PathProgramCache]: Analyzing trace with hash 651285045, now seen corresponding path program 1 times [2025-03-08 05:32:18,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:18,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684223591] [2025-03-08 05:32:18,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:18,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:18,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:32:18,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:32:18,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:18,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:18,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684223591] [2025-03-08 05:32:18,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684223591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:18,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:18,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:18,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010369405] [2025-03-08 05:32:18,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:18,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:18,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:18,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:18,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,492 INFO L87 Difference]: Start difference. First operand 27565 states and 47003 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:19,809 INFO L93 Difference]: Finished difference Result 75094 states and 128504 transitions. [2025-03-08 05:32:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:19,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-03-08 05:32:19,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:20,067 INFO L225 Difference]: With dead ends: 75094 [2025-03-08 05:32:20,067 INFO L226 Difference]: Without dead ends: 50360 [2025-03-08 05:32:20,146 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:32:20,149 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 88 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 856 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:32:20,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 856 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50360 states. [2025-03-08 05:32:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50360 to 50352. [2025-03-08 05:32:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50352 states, 41813 states have (on average 1.6119149546791667) internal successors, (67399), 41817 states have internal predecessors, (67399), 8516 states have call successors, (8516), 19 states have call predecessors, (8516), 22 states have return successors, (9661), 8515 states have call predecessors, (9661), 8515 states have call successors, (9661) [2025-03-08 05:32:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50352 states to 50352 states and 85576 transitions. [2025-03-08 05:32:22,071 INFO L78 Accepts]: Start accepts. Automaton has 50352 states and 85576 transitions. Word has length 141 [2025-03-08 05:32:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:22,071 INFO L471 AbstractCegarLoop]: Abstraction has 50352 states and 85576 transitions. [2025-03-08 05:32:22,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 50352 states and 85576 transitions. [2025-03-08 05:32:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 05:32:22,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:22,134 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:22,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:32:22,134 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:22,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:22,135 INFO L85 PathProgramCache]: Analyzing trace with hash -415418158, now seen corresponding path program 1 times [2025-03-08 05:32:22,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:22,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296192324] [2025-03-08 05:32:22,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:22,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 05:32:22,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 05:32:22,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:22,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296192324] [2025-03-08 05:32:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296192324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:22,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:22,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:22,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448333790] [2025-03-08 05:32:22,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:22,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:22,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:22,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:22,191 INFO L87 Difference]: Start difference. First operand 50352 states and 85576 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:23,967 INFO L93 Difference]: Finished difference Result 93836 states and 159836 transitions. [2025-03-08 05:32:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:23,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-03-08 05:32:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:24,362 INFO L225 Difference]: With dead ends: 93836 [2025-03-08 05:32:24,363 INFO L226 Difference]: Without dead ends: 93698 [2025-03-08 05:32:24,412 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:32:24,413 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 83 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 868 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:32:24,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 868 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93698 states. [2025-03-08 05:32:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93698 to 93690. [2025-03-08 05:32:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93690 states, 78352 states have (on average 1.6046176230345108) internal successors, (125725), 78356 states have internal predecessors, (125725), 15315 states have call successors, (15315), 19 states have call predecessors, (15315), 22 states have return successors, (17506), 15314 states have call predecessors, (17506), 15314 states have call successors, (17506) [2025-03-08 05:32:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93690 states to 93690 states and 158546 transitions. [2025-03-08 05:32:28,053 INFO L78 Accepts]: Start accepts. Automaton has 93690 states and 158546 transitions. Word has length 142 [2025-03-08 05:32:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:28,054 INFO L471 AbstractCegarLoop]: Abstraction has 93690 states and 158546 transitions. [2025-03-08 05:32:28,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 93690 states and 158546 transitions. [2025-03-08 05:32:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 05:32:28,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:28,132 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:28,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:32:28,132 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:28,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash 212507222, now seen corresponding path program 1 times [2025-03-08 05:32:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:28,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183579961] [2025-03-08 05:32:28,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:28,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:28,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 05:32:28,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 05:32:28,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:28,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:28,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:28,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183579961] [2025-03-08 05:32:28,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183579961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:28,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:28,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:32:28,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863987338] [2025-03-08 05:32:28,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:28,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:32:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:28,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:32:28,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:28,302 INFO L87 Difference]: Start difference. First operand 93690 states and 158546 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:31,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:31,162 INFO L93 Difference]: Finished difference Result 93956 states and 158911 transitions. [2025-03-08 05:32:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:32:31,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2025-03-08 05:32:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:31,710 INFO L225 Difference]: With dead ends: 93956 [2025-03-08 05:32:31,710 INFO L226 Difference]: Without dead ends: 93826 [2025-03-08 05:32:31,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:31,753 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 365 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:31,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1850 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93826 states. [2025-03-08 05:32:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93826 to 93822. [2025-03-08 05:32:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93822 states, 78459 states have (on average 1.6043921028817598) internal successors, (125879), 78463 states have internal predecessors, (125879), 15328 states have call successors, (15328), 29 states have call predecessors, (15328), 34 states have return successors, (17521), 15329 states have call predecessors, (17521), 15326 states have call successors, (17521) [2025-03-08 05:32:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93822 states to 93822 states and 158728 transitions. [2025-03-08 05:32:34,306 INFO L78 Accepts]: Start accepts. Automaton has 93822 states and 158728 transitions. Word has length 143 [2025-03-08 05:32:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:34,306 INFO L471 AbstractCegarLoop]: Abstraction has 93822 states and 158728 transitions. [2025-03-08 05:32:34,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 93822 states and 158728 transitions. [2025-03-08 05:32:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 05:32:34,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:34,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:34,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:32:34,379 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:34,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:34,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1456055522, now seen corresponding path program 1 times [2025-03-08 05:32:34,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:34,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091497093] [2025-03-08 05:32:34,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:34,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:34,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:32:34,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:32:34,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:34,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:34,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:34,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091497093] [2025-03-08 05:32:34,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091497093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:34,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 05:32:34,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913301389] [2025-03-08 05:32:34,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:34,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:32:34,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:34,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:32:34,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:32:34,723 INFO L87 Difference]: Start difference. First operand 93822 states and 158728 transitions. Second operand has 13 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15)