./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_spec1_product28.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 25a137cac87a0e16e274f725e7bbd21e6c99dd9079b93c306fff086ae4fee1e1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:39:19,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:39:19,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:39:19,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:39:19,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:39:19,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:39:19,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:39:19,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:39:19,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:39:19,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:39:19,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:39:19,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:39:19,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:39:19,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:39:19,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:39:19,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:39:19,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:39:19,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:39:19,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:39:19,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:39:19,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:39:19,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:39:19,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:39:19,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:39:19,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:39:19,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:39:19,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:39:19,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:39:19,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:39:19,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:39:19,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:39:19,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:39:19,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:39:19,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:39:19,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:39:19,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:39:19,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:39:19,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:39:19,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:39:19,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:39:19,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:39:19,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:39:19,962 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 25a137cac87a0e16e274f725e7bbd21e6c99dd9079b93c306fff086ae4fee1e1 [2024-11-11 20:39:20,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:39:20,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:39:20,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:39:20,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:39:20,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:39:20,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product28.cil.c [2024-11-11 20:39:21,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:39:21,824 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:39:21,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c [2024-11-11 20:39:21,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f1042e2/51cc73693c9146ff9a6b46156bc936bb/FLAGfa57a64cc [2024-11-11 20:39:21,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f1042e2/51cc73693c9146ff9a6b46156bc936bb [2024-11-11 20:39:21,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:39:21,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:39:21,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:39:21,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:39:21,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:39:21,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:39:21" (1/1) ... [2024-11-11 20:39:21,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d4ae2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:21, skipping insertion in model container [2024-11-11 20:39:21,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:39:21" (1/1) ... [2024-11-11 20:39:21,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:39:22,380 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_spec1_product28.cil.c[51091,51104] [2024-11-11 20:39:22,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:39:22,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:39:22,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2024-11-11 20:39:22,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1128] [2024-11-11 20:39:22,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1494] [2024-11-11 20:39:22,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1512] [2024-11-11 20:39:22,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [1561] [2024-11-11 20:39:22,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1592] [2024-11-11 20:39:22,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1739] [2024-11-11 20:39:22,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2019] [2024-11-11 20:39:22,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2232] [2024-11-11 20:39:22,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2241] [2024-11-11 20:39:22,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2643] [2024-11-11 20:39:22,607 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_spec1_product28.cil.c[51091,51104] [2024-11-11 20:39:22,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:39:22,651 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:39:22,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22 WrapperNode [2024-11-11 20:39:22,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:39:22,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:39:22,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:39:22,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:39:22,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,730 INFO L138 Inliner]: procedures = 128, calls = 196, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 859 [2024-11-11 20:39:22,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:39:22,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:39:22,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:39:22,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:39:22,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,776 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]. [2024-11-11 20:39:22,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:39:22,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:39:22,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:39:22,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:39:22,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (1/1) ... [2024-11-11 20:39:22,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:39:22,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:22,881 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) [2024-11-11 20:39:22,887 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 [2024-11-11 20:39:22,925 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-11 20:39:22,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-11 20:39:22,926 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:39:22,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:39:22,926 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:39:22,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:39:22,926 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:39:22,927 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:39:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:39:22,928 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:39:22,928 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:39:22,929 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:39:22,929 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:39:22,929 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:39:22,929 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:39:22,929 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:39:22,930 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:39:22,930 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:39:22,930 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:39:22,930 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:39:22,930 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:39:22,930 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:39:22,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:39:22,930 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:39:22,931 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:39:22,931 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-11 20:39:22,931 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-11 20:39:22,931 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:39:22,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:39:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:39:22,932 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:39:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:39:22,933 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:39:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:39:22,933 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:39:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:39:22,933 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:39:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:39:22,933 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:39:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:39:22,933 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:39:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:39:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:39:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:39:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:39:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:39:22,934 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:39:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:39:22,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:39:23,120 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:39:23,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:39:23,800 INFO L? ?]: Removed 398 outVars from TransFormulas that were not future-live. [2024-11-11 20:39:23,800 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:39:23,822 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:39:23,824 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:39:23,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:39:23 BoogieIcfgContainer [2024-11-11 20:39:23,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:39:23,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:39:23,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:39:23,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:39:23,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:39:21" (1/3) ... [2024-11-11 20:39:23,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6028bbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:39:23, skipping insertion in model container [2024-11-11 20:39:23,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:22" (2/3) ... [2024-11-11 20:39:23,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6028bbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:39:23, skipping insertion in model container [2024-11-11 20:39:23,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:39:23" (3/3) ... [2024-11-11 20:39:23,835 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product28.cil.c [2024-11-11 20:39:23,850 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:39:23,850 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:39:23,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:39:23,923 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;@22501d1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:39:23,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:39:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 327 states, 253 states have (on average 1.5217391304347827) internal successors, (385), 257 states have internal predecessors, (385), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-11 20:39:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 20:39:23,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:23,948 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] [2024-11-11 20:39:23,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash 610945282, now seen corresponding path program 1 times [2024-11-11 20:39:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973489230] [2024-11-11 20:39:23,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:23,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:39:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:39:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:39:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:39:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:39:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:39:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:39:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:39:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:39:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973489230] [2024-11-11 20:39:24,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973489230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:39:24,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272733700] [2024-11-11 20:39:24,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:24,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:24,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:24,567 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) [2024-11-11 20:39:24,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:39:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:24,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:39:24,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:39:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:39:24,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:39:24,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272733700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:24,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:39:24,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-11 20:39:24,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971470995] [2024-11-11 20:39:24,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:24,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:39:24,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:39:24,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:39:24,929 INFO L87 Difference]: Start difference. First operand has 327 states, 253 states have (on average 1.5217391304347827) internal successors, (385), 257 states have internal predecessors, (385), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:24,984 INFO L93 Difference]: Finished difference Result 505 states and 732 transitions. [2024-11-11 20:39:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:39:24,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-11-11 20:39:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:25,006 INFO L225 Difference]: With dead ends: 505 [2024-11-11 20:39:25,006 INFO L226 Difference]: Without dead ends: 320 [2024-11-11 20:39:25,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:39:25,018 INFO L435 NwaCegarLoop]: 481 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, 481 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 [2024-11-11 20:39:25,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:39:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-11 20:39:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-11 20:39:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 247 states have (on average 1.51417004048583) internal successors, (374), 250 states have internal predecessors, (374), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-11 20:39:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 473 transitions. [2024-11-11 20:39:25,096 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 473 transitions. Word has length 98 [2024-11-11 20:39:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:25,098 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 473 transitions. [2024-11-11 20:39:25,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 473 transitions. [2024-11-11 20:39:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:39:25,105 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:25,105 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] [2024-11-11 20:39:25,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:39:25,306 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 [2024-11-11 20:39:25,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:25,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2132313920, now seen corresponding path program 1 times [2024-11-11 20:39:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:25,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862058448] [2024-11-11 20:39:25,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:25,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:39:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:39:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:39:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:39:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:39:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:39:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:39:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:39:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:39:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:39:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:25,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862058448] [2024-11-11 20:39:25,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862058448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:39:25,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038980345] [2024-11-11 20:39:25,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:25,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:25,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:25,581 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) [2024-11-11 20:39:25,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:39:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:39:25,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:39:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:39:25,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:39:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038980345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:39:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 20:39:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322672788] [2024-11-11 20:39:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:25,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:39:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:25,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:39:25,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:39:25,903 INFO L87 Difference]: Start difference. First operand 320 states and 473 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:25,952 INFO L93 Difference]: Finished difference Result 495 states and 713 transitions. [2024-11-11 20:39:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:39:25,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-11 20:39:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:25,955 INFO L225 Difference]: With dead ends: 495 [2024-11-11 20:39:25,957 INFO L226 Difference]: Without dead ends: 323 [2024-11-11 20:39:25,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:39:25,962 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 1 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:25,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 940 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:39:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-11 20:39:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2024-11-11 20:39:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 249 states have (on average 1.5100401606425702) internal successors, (376), 252 states have internal predecessors, (376), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-11 20:39:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 475 transitions. [2024-11-11 20:39:25,982 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 475 transitions. Word has length 99 [2024-11-11 20:39:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:25,982 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 475 transitions. [2024-11-11 20:39:25,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 475 transitions. [2024-11-11 20:39:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 20:39:25,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:25,985 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 20:39:26,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:39:26,186 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 [2024-11-11 20:39:26,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:26,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:26,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2004971831, now seen corresponding path program 1 times [2024-11-11 20:39:26,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:26,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993956146] [2024-11-11 20:39:26,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:39:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:39:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:39:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:39:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:39:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:39:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:39:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:39:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:39:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:39:26,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993956146] [2024-11-11 20:39:26,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993956146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:39:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484735557] [2024-11-11 20:39:26,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:26,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:26,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:26,386 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) [2024-11-11 20:39:26,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:39:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:39:26,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:39:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:39:26,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:39:26,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484735557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:26,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:39:26,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 20:39:26,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519288493] [2024-11-11 20:39:26,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:26,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:39:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:26,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:39:26,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:39:26,652 INFO L87 Difference]: Start difference. First operand 322 states and 475 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:26,683 INFO L93 Difference]: Finished difference Result 669 states and 1001 transitions. [2024-11-11 20:39:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:39:26,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-11 20:39:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:26,686 INFO L225 Difference]: With dead ends: 669 [2024-11-11 20:39:26,686 INFO L226 Difference]: Without dead ends: 374 [2024-11-11 20:39:26,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:39:26,688 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 99 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 906 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 [2024-11-11 20:39:26,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 906 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:39:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-11 20:39:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 366. [2024-11-11 20:39:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 282 states have (on average 1.524822695035461) internal successors, (430), 285 states have internal predecessors, (430), 61 states have call successors, (61), 22 states have call predecessors, (61), 22 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-11 20:39:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 551 transitions. [2024-11-11 20:39:26,701 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 551 transitions. Word has length 105 [2024-11-11 20:39:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:26,701 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 551 transitions. [2024-11-11 20:39:26,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 551 transitions. [2024-11-11 20:39:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-11 20:39:26,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:26,703 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 20:39:26,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:39:26,904 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 [2024-11-11 20:39:26,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:26,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:26,905 INFO L85 PathProgramCache]: Analyzing trace with hash -949933875, now seen corresponding path program 1 times [2024-11-11 20:39:26,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:26,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107695278] [2024-11-11 20:39:26,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:26,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:26,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:39:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:39:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:39:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:39:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:39:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:39:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:39:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:39:27,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:27,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107695278] [2024-11-11 20:39:27,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107695278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:39:27,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609939821] [2024-11-11 20:39:27,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:27,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:27,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:27,067 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) [2024-11-11 20:39:27,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:39:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:39:27,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:39:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:39:27,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:39:27,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609939821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:27,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:39:27,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-11 20:39:27,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776438604] [2024-11-11 20:39:27,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:27,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:39:27,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:27,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:39:27,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:39:27,341 INFO L87 Difference]: Start difference. First operand 366 states and 551 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:39:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:27,399 INFO L93 Difference]: Finished difference Result 723 states and 1092 transitions. [2024-11-11 20:39:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:39:27,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-11 20:39:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:27,404 INFO L225 Difference]: With dead ends: 723 [2024-11-11 20:39:27,404 INFO L226 Difference]: Without dead ends: 368 [2024-11-11 20:39:27,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:39:27,407 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 2 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1849 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 [2024-11-11 20:39:27,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1849 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:39:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-11 20:39:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-11 20:39:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 283 states have (on average 1.5229681978798586) internal successors, (431), 287 states have internal predecessors, (431), 61 states have call successors, (61), 22 states have call predecessors, (61), 23 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2024-11-11 20:39:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 554 transitions. [2024-11-11 20:39:27,435 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 554 transitions. Word has length 106 [2024-11-11 20:39:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:27,436 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 554 transitions. [2024-11-11 20:39:27,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:39:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 554 transitions. [2024-11-11 20:39:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 20:39:27,444 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:27,444 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 20:39:27,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 20:39:27,645 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 [2024-11-11 20:39:27,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:27,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1105408777, now seen corresponding path program 1 times [2024-11-11 20:39:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:27,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184856883] [2024-11-11 20:39:27,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:39:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:39:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:39:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:39:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:39:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:39:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:39:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:39:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:39:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:27,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184856883] [2024-11-11 20:39:27,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184856883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:39:27,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783083971] [2024-11-11 20:39:27,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:27,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:27,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:27,849 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) [2024-11-11 20:39:27,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:39:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:39:28,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:39:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:39:28,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:39:28,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783083971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:28,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:39:28,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-11 20:39:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137475838] [2024-11-11 20:39:28,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:28,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:39:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:39:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:39:28,145 INFO L87 Difference]: Start difference. First operand 368 states and 554 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:39:28,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:28,206 INFO L93 Difference]: Finished difference Result 725 states and 1097 transitions. [2024-11-11 20:39:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:39:28,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2024-11-11 20:39:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:28,210 INFO L225 Difference]: With dead ends: 725 [2024-11-11 20:39:28,210 INFO L226 Difference]: Without dead ends: 370 [2024-11-11 20:39:28,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:39:28,212 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1835 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 [2024-11-11 20:39:28,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1835 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:39:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-11 20:39:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-11-11 20:39:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 284 states have (on average 1.5211267605633803) internal successors, (432), 289 states have internal predecessors, (432), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-11 20:39:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 560 transitions. [2024-11-11 20:39:28,223 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 560 transitions. Word has length 107 [2024-11-11 20:39:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:28,223 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 560 transitions. [2024-11-11 20:39:28,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:39:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 560 transitions. [2024-11-11 20:39:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 20:39:28,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:28,225 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] [2024-11-11 20:39:28,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:39:28,425 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 [2024-11-11 20:39:28,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:28,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:28,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1048003723, now seen corresponding path program 1 times [2024-11-11 20:39:28,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:28,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623116832] [2024-11-11 20:39:28,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:28,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:39:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:39:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:39:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:39:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:39:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:39:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:39:28,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:28,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623116832] [2024-11-11 20:39:28,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623116832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:28,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:28,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:39:28,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879813946] [2024-11-11 20:39:28,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:28,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:39:28,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:28,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:39:28,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:39:28,597 INFO L87 Difference]: Start difference. First operand 370 states and 560 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:39:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:29,952 INFO L93 Difference]: Finished difference Result 788 states and 1199 transitions. [2024-11-11 20:39:29,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:29,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-11 20:39:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:29,959 INFO L225 Difference]: With dead ends: 788 [2024-11-11 20:39:29,959 INFO L226 Difference]: Without dead ends: 441 [2024-11-11 20:39:29,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:39:29,961 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 767 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:29,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 926 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:39:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-11 20:39:29,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 370. [2024-11-11 20:39:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 284 states have (on average 1.5211267605633803) internal successors, (432), 289 states have internal predecessors, (432), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2024-11-11 20:39:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 559 transitions. [2024-11-11 20:39:29,988 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 559 transitions. Word has length 108 [2024-11-11 20:39:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:29,988 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 559 transitions. [2024-11-11 20:39:29,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:39:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 559 transitions. [2024-11-11 20:39:29,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:39:29,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:29,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:29,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:39:29,991 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:29,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:29,991 INFO L85 PathProgramCache]: Analyzing trace with hash -887305513, now seen corresponding path program 2 times [2024-11-11 20:39:29,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:29,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209250361] [2024-11-11 20:39:29,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:39:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:39:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:39:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:39:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:39:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:39:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:39:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:39:30,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:30,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209250361] [2024-11-11 20:39:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209250361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:30,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:30,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:39:30,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081286661] [2024-11-11 20:39:30,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:30,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:39:30,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:30,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:39:30,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:39:30,170 INFO L87 Difference]: Start difference. First operand 370 states and 559 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:39:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:31,476 INFO L93 Difference]: Finished difference Result 790 states and 1202 transitions. [2024-11-11 20:39:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:31,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-11 20:39:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:31,479 INFO L225 Difference]: With dead ends: 790 [2024-11-11 20:39:31,479 INFO L226 Difference]: Without dead ends: 443 [2024-11-11 20:39:31,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:39:31,481 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 764 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:31,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 926 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:39:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-11 20:39:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 372. [2024-11-11 20:39:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 285 states have (on average 1.5192982456140351) internal successors, (433), 291 states have internal predecessors, (433), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (68), 60 states have call predecessors, (68), 60 states have call successors, (68) [2024-11-11 20:39:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 562 transitions. [2024-11-11 20:39:31,506 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 562 transitions. Word has length 109 [2024-11-11 20:39:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:31,508 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 562 transitions. [2024-11-11 20:39:31,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:39:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 562 transitions. [2024-11-11 20:39:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:39:31,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:31,511 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] [2024-11-11 20:39:31,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:39:31,511 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:31,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1465707430, now seen corresponding path program 1 times [2024-11-11 20:39:31,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:31,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708387100] [2024-11-11 20:39:31,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:39:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:39:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:39:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:39:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:39:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:39:31,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:31,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708387100] [2024-11-11 20:39:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708387100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:31,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:31,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:39:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724375919] [2024-11-11 20:39:31,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:31,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:39:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:39:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:39:31,704 INFO L87 Difference]: Start difference. First operand 372 states and 562 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-11 20:39:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:33,377 INFO L93 Difference]: Finished difference Result 788 states and 1197 transitions. [2024-11-11 20:39:33,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:39:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 110 [2024-11-11 20:39:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:33,380 INFO L225 Difference]: With dead ends: 788 [2024-11-11 20:39:33,380 INFO L226 Difference]: Without dead ends: 443 [2024-11-11 20:39:33,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:39:33,382 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 767 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 3282 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 3516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 3282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:33,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1329 Invalid, 3516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 3282 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 20:39:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-11 20:39:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 372. [2024-11-11 20:39:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 285 states have (on average 1.5192982456140351) internal successors, (433), 291 states have internal predecessors, (433), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-11 20:39:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 561 transitions. [2024-11-11 20:39:33,401 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 561 transitions. Word has length 110 [2024-11-11 20:39:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:33,402 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 561 transitions. [2024-11-11 20:39:33,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-11 20:39:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 561 transitions. [2024-11-11 20:39:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:39:33,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:33,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:33,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:39:33,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:33,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:33,404 INFO L85 PathProgramCache]: Analyzing trace with hash -499579042, now seen corresponding path program 2 times [2024-11-11 20:39:33,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:33,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330744483] [2024-11-11 20:39:33,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:39:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:39:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:39:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:39:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:39:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:39:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:39:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:33,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330744483] [2024-11-11 20:39:33,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330744483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:33,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:33,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:39:33,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586965471] [2024-11-11 20:39:33,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:33,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:39:33,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:33,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:39:33,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:39:33,559 INFO L87 Difference]: Start difference. First operand 372 states and 561 transitions. Second operand has 11 states, 10 states have (on average 7.7) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-11 20:39:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:35,145 INFO L93 Difference]: Finished difference Result 790 states and 1203 transitions. [2024-11-11 20:39:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:39:35,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 111 [2024-11-11 20:39:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:35,150 INFO L225 Difference]: With dead ends: 790 [2024-11-11 20:39:35,150 INFO L226 Difference]: Without dead ends: 445 [2024-11-11 20:39:35,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:39:35,153 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 764 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:35,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1330 Invalid, 3541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 3309 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:39:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-11 20:39:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 374. [2024-11-11 20:39:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 286 states have (on average 1.5174825174825175) internal successors, (434), 293 states have internal predecessors, (434), 61 states have call successors, (61), 22 states have call predecessors, (61), 26 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2024-11-11 20:39:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 567 transitions. [2024-11-11 20:39:35,184 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 567 transitions. Word has length 111 [2024-11-11 20:39:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:35,184 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 567 transitions. [2024-11-11 20:39:35,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-11 20:39:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 567 transitions. [2024-11-11 20:39:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:39:35,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:35,187 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] [2024-11-11 20:39:35,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:39:35,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:35,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:35,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1056550783, now seen corresponding path program 1 times [2024-11-11 20:39:35,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:35,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161981892] [2024-11-11 20:39:35,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:39:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:39:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:39:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:39:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:39:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:39:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:35,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161981892] [2024-11-11 20:39:35,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161981892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:39:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720744980] [2024-11-11 20:39:35,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:35,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:35,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:35,339 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) [2024-11-11 20:39:35,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:39:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:39:35,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:39:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:35,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:39:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:35,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720744980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:39:35,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:39:35,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-11 20:39:35,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648805725] [2024-11-11 20:39:35,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:39:35,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:39:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:39:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:35,666 INFO L87 Difference]: Start difference. First operand 374 states and 567 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:39:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:37,063 INFO L93 Difference]: Finished difference Result 944 states and 1501 transitions. [2024-11-11 20:39:37,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:39:37,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2024-11-11 20:39:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:37,071 INFO L225 Difference]: With dead ends: 944 [2024-11-11 20:39:37,071 INFO L226 Difference]: Without dead ends: 772 [2024-11-11 20:39:37,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:39:37,073 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1056 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:37,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 1452 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:39:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-11 20:39:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 677. [2024-11-11 20:39:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 525 states have (on average 1.5847619047619048) internal successors, (832), 532 states have internal predecessors, (832), 125 states have call successors, (125), 22 states have call predecessors, (125), 26 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2024-11-11 20:39:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1103 transitions. [2024-11-11 20:39:37,119 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1103 transitions. Word has length 112 [2024-11-11 20:39:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:37,120 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1103 transitions. [2024-11-11 20:39:37,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:39:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1103 transitions. [2024-11-11 20:39:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:39:37,123 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:37,123 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] [2024-11-11 20:39:37,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 20:39:37,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:37,324 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:37,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:37,324 INFO L85 PathProgramCache]: Analyzing trace with hash 88149732, now seen corresponding path program 1 times [2024-11-11 20:39:37,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:37,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784592256] [2024-11-11 20:39:37,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:37,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:39:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:39:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:39:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:39:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:39:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:37,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784592256] [2024-11-11 20:39:37,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784592256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:37,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976804598] [2024-11-11 20:39:37,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:37,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:37,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:37,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:37,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:37,422 INFO L87 Difference]: Start difference. First operand 677 states and 1103 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:38,386 INFO L93 Difference]: Finished difference Result 1665 states and 2780 transitions. [2024-11-11 20:39:38,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:38,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2024-11-11 20:39:38,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:38,391 INFO L225 Difference]: With dead ends: 1665 [2024-11-11 20:39:38,392 INFO L226 Difference]: Without dead ends: 1056 [2024-11-11 20:39:38,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:38,394 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 860 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:38,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 666 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:39:38,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-11 20:39:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 977. [2024-11-11 20:39:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 761 states have (on average 1.5992115637319317) internal successors, (1217), 768 states have internal predecessors, (1217), 189 states have call successors, (189), 22 states have call predecessors, (189), 26 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2024-11-11 20:39:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1626 transitions. [2024-11-11 20:39:38,430 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1626 transitions. Word has length 118 [2024-11-11 20:39:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:38,431 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1626 transitions. [2024-11-11 20:39:38,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1626 transitions. [2024-11-11 20:39:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 20:39:38,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:38,435 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] [2024-11-11 20:39:38,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:39:38,435 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:38,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash 418572611, now seen corresponding path program 1 times [2024-11-11 20:39:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:38,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643060216] [2024-11-11 20:39:38,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:38,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:39:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:39:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:39:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:39:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:39:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:39:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:38,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:38,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643060216] [2024-11-11 20:39:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643060216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:38,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:38,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708146007] [2024-11-11 20:39:38,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:38,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:38,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:38,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:38,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:38,510 INFO L87 Difference]: Start difference. First operand 977 states and 1626 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:39,480 INFO L93 Difference]: Finished difference Result 2380 states and 4025 transitions. [2024-11-11 20:39:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-11 20:39:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:39,488 INFO L225 Difference]: With dead ends: 2380 [2024-11-11 20:39:39,488 INFO L226 Difference]: Without dead ends: 1524 [2024-11-11 20:39:39,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:39,491 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 858 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:39,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 657 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:39:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-11 20:39:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1445. [2024-11-11 20:39:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1134 states have (on average 1.6084656084656084) internal successors, (1824), 1141 states have internal predecessors, (1824), 284 states have call successors, (284), 22 states have call predecessors, (284), 26 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2024-11-11 20:39:39,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2423 transitions. [2024-11-11 20:39:39,545 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2423 transitions. Word has length 119 [2024-11-11 20:39:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:39,546 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2423 transitions. [2024-11-11 20:39:39,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2423 transitions. [2024-11-11 20:39:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:39:39,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:39,552 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] [2024-11-11 20:39:39,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:39:39,552 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:39,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2089768670, now seen corresponding path program 1 times [2024-11-11 20:39:39,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881661263] [2024-11-11 20:39:39,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:39:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:39:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:39:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:39:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:39:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:39:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:39,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:39,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881661263] [2024-11-11 20:39:39,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881661263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:39,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:39,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:39,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889705738] [2024-11-11 20:39:39,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:39,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:39,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:39,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:39,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:39,665 INFO L87 Difference]: Start difference. First operand 1445 states and 2423 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:40,581 INFO L93 Difference]: Finished difference Result 3427 states and 5866 transitions. [2024-11-11 20:39:40,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:40,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-11 20:39:40,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:40,593 INFO L225 Difference]: With dead ends: 3427 [2024-11-11 20:39:40,593 INFO L226 Difference]: Without dead ends: 2228 [2024-11-11 20:39:40,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:40,598 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 856 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:40,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 646 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:39:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-11-11 20:39:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2149. [2024-11-11 20:39:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 1715 states have (on average 1.6157434402332362) internal successors, (2771), 1722 states have internal predecessors, (2771), 407 states have call successors, (407), 22 states have call predecessors, (407), 26 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2024-11-11 20:39:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3632 transitions. [2024-11-11 20:39:40,687 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3632 transitions. Word has length 120 [2024-11-11 20:39:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:40,687 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3632 transitions. [2024-11-11 20:39:40,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3632 transitions. [2024-11-11 20:39:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 20:39:40,694 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:40,695 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] [2024-11-11 20:39:40,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:39:40,695 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:40,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1022927198, now seen corresponding path program 1 times [2024-11-11 20:39:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093163206] [2024-11-11 20:39:40,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:39:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:39:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:39:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:39:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:39:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:39:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093163206] [2024-11-11 20:39:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093163206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:40,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:40,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:40,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117166496] [2024-11-11 20:39:40,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:40,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:40,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:40,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:40,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:40,768 INFO L87 Difference]: Start difference. First operand 2149 states and 3632 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:41,627 INFO L93 Difference]: Finished difference Result 5046 states and 8720 transitions. [2024-11-11 20:39:41,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:41,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-11 20:39:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:41,644 INFO L225 Difference]: With dead ends: 5046 [2024-11-11 20:39:41,644 INFO L226 Difference]: Without dead ends: 3347 [2024-11-11 20:39:41,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:41,652 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 854 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:41,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 646 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:39:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2024-11-11 20:39:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3268. [2024-11-11 20:39:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3268 states, 2655 states have (on average 1.6203389830508474) internal successors, (4302), 2662 states have internal predecessors, (4302), 586 states have call successors, (586), 22 states have call predecessors, (586), 26 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2024-11-11 20:39:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 5547 transitions. [2024-11-11 20:39:41,781 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 5547 transitions. Word has length 121 [2024-11-11 20:39:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:41,781 INFO L471 AbstractCegarLoop]: Abstraction has 3268 states and 5547 transitions. [2024-11-11 20:39:41,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 5547 transitions. [2024-11-11 20:39:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 20:39:41,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:41,791 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] [2024-11-11 20:39:41,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:39:41,791 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:41,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1502297978, now seen corresponding path program 1 times [2024-11-11 20:39:41,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:41,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82214456] [2024-11-11 20:39:41,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:41,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:39:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:39:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:39:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:39:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:39:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:39:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:41,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82214456] [2024-11-11 20:39:41,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82214456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:41,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:41,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:41,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985864108] [2024-11-11 20:39:41,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:41,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:41,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:41,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:41,918 INFO L87 Difference]: Start difference. First operand 3268 states and 5547 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:42,812 INFO L93 Difference]: Finished difference Result 7964 states and 13819 transitions. [2024-11-11 20:39:42,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:42,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-11 20:39:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:42,841 INFO L225 Difference]: With dead ends: 7964 [2024-11-11 20:39:42,841 INFO L226 Difference]: Without dead ends: 5378 [2024-11-11 20:39:42,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:42,852 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 852 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:42,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 698 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:39:42,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2024-11-11 20:39:43,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 5299. [2024-11-11 20:39:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 4310 states have (on average 1.6134570765661254) internal successors, (6954), 4317 states have internal predecessors, (6954), 962 states have call successors, (962), 22 states have call predecessors, (962), 26 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2024-11-11 20:39:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 8995 transitions. [2024-11-11 20:39:43,096 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 8995 transitions. Word has length 122 [2024-11-11 20:39:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:43,097 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 8995 transitions. [2024-11-11 20:39:43,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 8995 transitions. [2024-11-11 20:39:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 20:39:43,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:43,111 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] [2024-11-11 20:39:43,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:39:43,111 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:43,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1397339966, now seen corresponding path program 1 times [2024-11-11 20:39:43,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:43,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654903644] [2024-11-11 20:39:43,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:43,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:39:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:39:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:39:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:39:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:39:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:39:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:43,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654903644] [2024-11-11 20:39:43,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654903644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:43,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:43,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:43,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018558848] [2024-11-11 20:39:43,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:43,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:43,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:43,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:43,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:43,186 INFO L87 Difference]: Start difference. First operand 5299 states and 8995 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:44,171 INFO L93 Difference]: Finished difference Result 13106 states and 22728 transitions. [2024-11-11 20:39:44,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:44,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2024-11-11 20:39:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:44,217 INFO L225 Difference]: With dead ends: 13106 [2024-11-11 20:39:44,217 INFO L226 Difference]: Without dead ends: 8866 [2024-11-11 20:39:44,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:44,231 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 850 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:44,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 647 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:39:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2024-11-11 20:39:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 8787. [2024-11-11 20:39:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8787 states, 7192 states have (on average 1.6112347052280311) internal successors, (11588), 7199 states have internal predecessors, (11588), 1568 states have call successors, (1568), 22 states have call predecessors, (1568), 26 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2024-11-11 20:39:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8787 states to 8787 states and 14919 transitions. [2024-11-11 20:39:44,606 INFO L78 Accepts]: Start accepts. Automaton has 8787 states and 14919 transitions. Word has length 123 [2024-11-11 20:39:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:44,606 INFO L471 AbstractCegarLoop]: Abstraction has 8787 states and 14919 transitions. [2024-11-11 20:39:44,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 8787 states and 14919 transitions. [2024-11-11 20:39:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:39:44,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:44,624 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] [2024-11-11 20:39:44,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:39:44,625 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:44,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:44,625 INFO L85 PathProgramCache]: Analyzing trace with hash 213501156, now seen corresponding path program 1 times [2024-11-11 20:39:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:44,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821624034] [2024-11-11 20:39:44,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:39:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:39:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:39:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:39:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:39:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:39:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821624034] [2024-11-11 20:39:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821624034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:44,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:44,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566889114] [2024-11-11 20:39:44,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:44,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:44,705 INFO L87 Difference]: Start difference. First operand 8787 states and 14919 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:45,697 INFO L93 Difference]: Finished difference Result 22765 states and 39434 transitions. [2024-11-11 20:39:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:45,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2024-11-11 20:39:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:45,758 INFO L225 Difference]: With dead ends: 22765 [2024-11-11 20:39:45,759 INFO L226 Difference]: Without dead ends: 15459 [2024-11-11 20:39:45,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:45,781 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 848 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:45,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 682 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:39:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2024-11-11 20:39:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 15380. [2024-11-11 20:39:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15380 states, 12582 states have (on average 1.6018121125417262) internal successors, (20154), 12589 states have internal predecessors, (20154), 2771 states have call successors, (2771), 22 states have call predecessors, (2771), 26 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2024-11-11 20:39:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15380 states to 15380 states and 26035 transitions. [2024-11-11 20:39:46,277 INFO L78 Accepts]: Start accepts. Automaton has 15380 states and 26035 transitions. Word has length 124 [2024-11-11 20:39:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:46,278 INFO L471 AbstractCegarLoop]: Abstraction has 15380 states and 26035 transitions. [2024-11-11 20:39:46,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 15380 states and 26035 transitions. [2024-11-11 20:39:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 20:39:46,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:46,302 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] [2024-11-11 20:39:46,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:39:46,302 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:46,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:46,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1851360003, now seen corresponding path program 1 times [2024-11-11 20:39:46,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:46,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846084146] [2024-11-11 20:39:46,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:46,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:39:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:39:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:39:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:39:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:39:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:39:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:46,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:46,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846084146] [2024-11-11 20:39:46,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846084146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:46,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:46,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:46,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897185358] [2024-11-11 20:39:46,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:46,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:46,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:46,393 INFO L87 Difference]: Start difference. First operand 15380 states and 26035 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:47,957 INFO L93 Difference]: Finished difference Result 40721 states and 70417 transitions. [2024-11-11 20:39:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:47,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2024-11-11 20:39:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:48,077 INFO L225 Difference]: With dead ends: 40721 [2024-11-11 20:39:48,078 INFO L226 Difference]: Without dead ends: 27429 [2024-11-11 20:39:48,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:48,113 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 846 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:48,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 647 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:39:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27429 states. [2024-11-11 20:39:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27429 to 27350. [2024-11-11 20:39:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27350 states, 22513 states have (on average 1.5973881757206947) internal successors, (35962), 22520 states have internal predecessors, (35962), 4810 states have call successors, (4810), 22 states have call predecessors, (4810), 26 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2024-11-11 20:39:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27350 states to 27350 states and 46195 transitions. [2024-11-11 20:39:49,200 INFO L78 Accepts]: Start accepts. Automaton has 27350 states and 46195 transitions. Word has length 125 [2024-11-11 20:39:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:49,201 INFO L471 AbstractCegarLoop]: Abstraction has 27350 states and 46195 transitions. [2024-11-11 20:39:49,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 27350 states and 46195 transitions. [2024-11-11 20:39:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 20:39:49,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:49,231 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] [2024-11-11 20:39:49,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:39:49,231 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:49,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1715555102, now seen corresponding path program 1 times [2024-11-11 20:39:49,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:49,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123931777] [2024-11-11 20:39:49,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:39:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:39:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:39:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:39:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:39:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:39:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:49,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:49,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123931777] [2024-11-11 20:39:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123931777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:49,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:49,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:49,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964367718] [2024-11-11 20:39:49,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:49,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:49,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:49,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:49,333 INFO L87 Difference]: Start difference. First operand 27350 states and 46195 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:51,506 INFO L93 Difference]: Finished difference Result 74508 states and 128016 transitions. [2024-11-11 20:39:51,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-11 20:39:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:51,704 INFO L225 Difference]: With dead ends: 74508 [2024-11-11 20:39:51,704 INFO L226 Difference]: Without dead ends: 49978 [2024-11-11 20:39:51,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:51,765 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 844 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:51,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 671 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:39:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2024-11-11 20:39:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49899. [2024-11-11 20:39:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49899 states, 41347 states have (on average 1.5914818487435607) internal successors, (65803), 41354 states have internal predecessors, (65803), 8525 states have call successors, (8525), 22 states have call predecessors, (8525), 26 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2024-11-11 20:39:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49899 states to 49899 states and 83998 transitions. [2024-11-11 20:39:53,801 INFO L78 Accepts]: Start accepts. Automaton has 49899 states and 83998 transitions. Word has length 126 [2024-11-11 20:39:53,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:53,802 INFO L471 AbstractCegarLoop]: Abstraction has 49899 states and 83998 transitions. [2024-11-11 20:39:53,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 49899 states and 83998 transitions. [2024-11-11 20:39:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 20:39:53,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:53,827 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] [2024-11-11 20:39:53,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:39:53,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:53,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash 425305917, now seen corresponding path program 1 times [2024-11-11 20:39:53,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:53,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157607208] [2024-11-11 20:39:53,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:39:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:39:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:39:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:39:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:39:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:39:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:53,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157607208] [2024-11-11 20:39:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157607208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:53,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:53,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693636318] [2024-11-11 20:39:53,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:53,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:53,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:53,916 INFO L87 Difference]: Start difference. First operand 49899 states and 83998 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:39:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:56,592 INFO L93 Difference]: Finished difference Result 92994 states and 160147 transitions. [2024-11-11 20:39:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:56,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2024-11-11 20:39:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:56,915 INFO L225 Difference]: With dead ends: 92994 [2024-11-11 20:39:56,915 INFO L226 Difference]: Without dead ends: 92822 [2024-11-11 20:39:56,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:56,955 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 839 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:56,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 655 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:39:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92822 states. [2024-11-11 20:40:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92822 to 92743. [2024-11-11 20:40:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92743 states, 77392 states have (on average 1.5840009303287161) internal successors, (122589), 77399 states have internal predecessors, (122589), 15324 states have call successors, (15324), 22 states have call predecessors, (15324), 26 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2024-11-11 20:40:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92743 states to 92743 states and 155428 transitions. [2024-11-11 20:40:00,517 INFO L78 Accepts]: Start accepts. Automaton has 92743 states and 155428 transitions. Word has length 127 [2024-11-11 20:40:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:00,518 INFO L471 AbstractCegarLoop]: Abstraction has 92743 states and 155428 transitions. [2024-11-11 20:40:00,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:40:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 92743 states and 155428 transitions. [2024-11-11 20:40:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 20:40:00,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:00,548 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] [2024-11-11 20:40:00,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:40:00,549 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:00,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:00,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1225218141, now seen corresponding path program 1 times [2024-11-11 20:40:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:00,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558399522] [2024-11-11 20:40:00,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:40:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:40:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:40:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:40:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:40:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:00,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:00,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558399522] [2024-11-11 20:40:00,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558399522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:00,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:00,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-11 20:40:00,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972072458] [2024-11-11 20:40:00,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:00,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 20:40:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:00,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 20:40:00,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:40:00,838 INFO L87 Difference]: Start difference. First operand 92743 states and 155428 transitions. Second operand has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 11 states have internal predecessors, (89), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-11 20:40:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:08,325 INFO L93 Difference]: Finished difference Result 185256 states and 322377 transitions. [2024-11-11 20:40:08,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-11 20:40:08,326 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 11 states have internal predecessors, (89), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 128 [2024-11-11 20:40:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:09,122 INFO L225 Difference]: With dead ends: 185256 [2024-11-11 20:40:09,122 INFO L226 Difference]: Without dead ends: 185092 [2024-11-11 20:40:09,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=512, Invalid=1938, Unknown=0, NotChecked=0, Total=2450 [2024-11-11 20:40:09,195 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 3364 mSDsluCounter, 2282 mSDsCounter, 0 mSdLazyCounter, 6500 mSolverCounterSat, 1046 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3364 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 7546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1046 IncrementalHoareTripleChecker+Valid, 6500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:09,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3364 Valid, 2507 Invalid, 7546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1046 Valid, 6500 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 20:40:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185092 states. [2024-11-11 20:40:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185092 to 184738. [2024-11-11 20:40:15,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184738 states, 154229 states have (on average 1.5848900012319342) internal successors, (244436), 154133 states have internal predecessors, (244436), 30443 states have call successors, (30443), 59 states have call predecessors, (30443), 65 states have return successors, (38094), 30551 states have call predecessors, (38094), 30440 states have call successors, (38094) [2024-11-11 20:40:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184738 states to 184738 states and 312973 transitions. [2024-11-11 20:40:16,753 INFO L78 Accepts]: Start accepts. Automaton has 184738 states and 312973 transitions. Word has length 128 [2024-11-11 20:40:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:16,754 INFO L471 AbstractCegarLoop]: Abstraction has 184738 states and 312973 transitions. [2024-11-11 20:40:16,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 11 states have internal predecessors, (89), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-11 20:40:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 184738 states and 312973 transitions. [2024-11-11 20:40:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 20:40:16,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:16,813 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] [2024-11-11 20:40:16,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:40:16,813 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:16,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:16,813 INFO L85 PathProgramCache]: Analyzing trace with hash 119811374, now seen corresponding path program 1 times [2024-11-11 20:40:16,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:16,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632258396] [2024-11-11 20:40:16,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:16,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:40:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:40:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:40:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:40:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:40:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:17,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:17,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632258396] [2024-11-11 20:40:17,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632258396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:17,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:17,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 20:40:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025306757] [2024-11-11 20:40:17,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:17,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 20:40:17,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:17,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 20:40:17,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:40:17,015 INFO L87 Difference]: Start difference. First operand 184738 states and 312973 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 8 states have internal predecessors, (90), 5 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-11 20:40:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:23,130 INFO L93 Difference]: Finished difference Result 185830 states and 321072 transitions. [2024-11-11 20:40:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 20:40:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 8 states have internal predecessors, (90), 5 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 129 [2024-11-11 20:40:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:23,854 INFO L225 Difference]: With dead ends: 185830 [2024-11-11 20:40:23,854 INFO L226 Difference]: Without dead ends: 185054 [2024-11-11 20:40:23,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2024-11-11 20:40:23,930 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1539 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 3716 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 3716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:23,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 1430 Invalid, 4198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 3716 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:40:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185054 states. [2024-11-11 20:40:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185054 to 184829. [2024-11-11 20:40:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184829 states, 154295 states have (on average 1.5848148028127937) internal successors, (244529), 154204 states have internal predecessors, (244529), 30465 states have call successors, (30465), 62 states have call predecessors, (30465), 68 states have return successors, (38125), 30571 states have call predecessors, (38125), 30462 states have call successors, (38125) [2024-11-11 20:40:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184829 states to 184829 states and 313119 transitions. [2024-11-11 20:40:30,977 INFO L78 Accepts]: Start accepts. Automaton has 184829 states and 313119 transitions. Word has length 129 [2024-11-11 20:40:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:30,977 INFO L471 AbstractCegarLoop]: Abstraction has 184829 states and 313119 transitions. [2024-11-11 20:40:30,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 8 states have internal predecessors, (90), 5 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-11 20:40:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 184829 states and 313119 transitions. [2024-11-11 20:40:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 20:40:31,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:31,585 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] [2024-11-11 20:40:31,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 20:40:31,585 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:31,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash 474835644, now seen corresponding path program 1 times [2024-11-11 20:40:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:31,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857774459] [2024-11-11 20:40:31,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:31,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:40:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:40:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:40:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:40:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:40:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:31,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857774459] [2024-11-11 20:40:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857774459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:31,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:40:31,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019793537] [2024-11-11 20:40:31,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:31,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:40:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:31,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:40:31,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:40:31,749 INFO L87 Difference]: Start difference. First operand 184829 states and 313119 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)