./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product32.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5711b4c0ea669ac051f0ad97dbc3a1a473a1622b7d95c937325001ba5ca1073b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:50:04,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:50:04,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:50:04,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:50:04,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:50:04,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:50:04,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:50:04,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:50:04,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:50:04,821 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:50:04,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:50:04,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:50:04,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:50:04,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:50:04,822 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:50:04,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:50:04,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:50:04,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:50:04,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:50:04,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:50:04,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:50:04,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:50:04,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:50:04,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:50:04,827 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:50:04,827 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:50:04,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:50:04,830 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:50:04,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:50:04,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:50:04,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:50:04,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:50:04,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:50:04,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:50:04,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:50:04,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:50:04,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:50:04,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:50:04,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:50:04,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:50:04,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:50:04,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:50:04,834 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-clean/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-clean/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 -> 5711b4c0ea669ac051f0ad97dbc3a1a473a1622b7d95c937325001ba5ca1073b [2024-10-11 02:50:05,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:50:05,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:50:05,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:50:05,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:50:05,050 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:50:05,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product32.cil.c [2024-10-11 02:50:06,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:50:06,799 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:50:06,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product32.cil.c [2024-10-11 02:50:06,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cfe919426/5a1b3cfa8c264ca68825aff13c5f4187/FLAG637fc330d [2024-10-11 02:50:06,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cfe919426/5a1b3cfa8c264ca68825aff13c5f4187 [2024-10-11 02:50:06,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:50:06,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:50:06,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:50:06,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:50:06,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:50:06,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:50:06" (1/1) ... [2024-10-11 02:50:06,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c186c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:06, skipping insertion in model container [2024-10-11 02:50:06,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:50:06" (1/1) ... [2024-10-11 02:50:06,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:50:07,255 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product32.cil.c[32699,32712] [2024-10-11 02:50:07,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:50:07,415 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:50:07,423 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-11 02:50:07,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [97] [2024-10-11 02:50:07,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1177] [2024-10-11 02:50:07,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1484] [2024-10-11 02:50:07,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1493] [2024-10-11 02:50:07,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1641] [2024-10-11 02:50:07,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2046] [2024-10-11 02:50:07,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2073] [2024-10-11 02:50:07,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2090] [2024-10-11 02:50:07,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2456] [2024-10-11 02:50:07,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2675] [2024-10-11 02:50:07,475 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product32.cil.c[32699,32712] [2024-10-11 02:50:07,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:50:07,566 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:50:07,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07 WrapperNode [2024-10-11 02:50:07,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:50:07,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:50:07,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:50:07,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:50:07,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,669 INFO L138 Inliner]: procedures = 134, calls = 219, calls flagged for inlining = 61, calls inlined = 53, statements flattened = 985 [2024-10-11 02:50:07,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:50:07,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:50:07,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:50:07,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:50:07,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,717 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-10-11 02:50:07,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:50:07,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:50:07,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:50:07,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:50:07,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (1/1) ... [2024-10-11 02:50:07,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:50:07,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:07,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:50:07,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:50:07,824 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-11 02:50:07,824 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-11 02:50:07,825 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-11 02:50:07,825 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-11 02:50:07,825 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-11 02:50:07,825 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-11 02:50:07,825 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-11 02:50:07,826 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-11 02:50:07,826 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-11 02:50:07,826 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-11 02:50:07,826 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:50:07,827 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:50:07,827 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2024-10-11 02:50:07,827 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2024-10-11 02:50:07,827 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:50:07,827 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:50:07,828 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:50:07,828 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:50:07,828 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:50:07,828 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:50:07,828 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-11 02:50:07,828 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-11 02:50:07,828 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-11 02:50:07,828 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-11 02:50:07,828 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:50:07,829 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:50:07,829 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:50:07,829 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:50:07,829 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:50:07,829 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:50:07,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:50:07,829 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-11 02:50:07,829 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-11 02:50:07,830 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-11 02:50:07,830 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-11 02:50:07,830 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-11 02:50:07,830 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-11 02:50:07,830 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:50:07,830 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:50:07,830 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:50:07,830 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:50:07,830 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:50:07,830 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:50:07,830 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-11 02:50:07,831 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-11 02:50:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:50:07,831 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:50:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-11 02:50:07,831 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-11 02:50:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:50:07,831 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:50:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-11 02:50:07,831 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-11 02:50:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:50:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:50:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:50:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:50:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:50:07,832 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:50:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-11 02:50:07,832 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-11 02:50:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:50:07,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:50:07,989 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:50:07,991 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:50:08,852 INFO L? ?]: Removed 537 outVars from TransFormulas that were not future-live. [2024-10-11 02:50:08,853 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:50:08,904 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:50:08,904 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:50:08,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:50:08 BoogieIcfgContainer [2024-10-11 02:50:08,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:50:08,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:50:08,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:50:08,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:50:08,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:50:06" (1/3) ... [2024-10-11 02:50:08,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bca802b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:50:08, skipping insertion in model container [2024-10-11 02:50:08,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:07" (2/3) ... [2024-10-11 02:50:08,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bca802b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:50:08, skipping insertion in model container [2024-10-11 02:50:08,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:50:08" (3/3) ... [2024-10-11 02:50:08,918 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec4_product32.cil.c [2024-10-11 02:50:08,933 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:50:08,933 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:50:09,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:50:09,010 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;@1b73c40c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:50:09,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:50:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 302 states have (on average 1.6026490066225165) internal successors, (484), 307 states have internal predecessors, (484), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 02:50:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 02:50:09,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:09,033 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:09,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:09,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:09,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1455891148, now seen corresponding path program 1 times [2024-10-11 02:50:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:09,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964803598] [2024-10-11 02:50:09,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:50:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:50:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:50:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:50:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:50:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:50:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:50:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:50:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:50:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:50:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:50:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:50:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 02:50:09,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964803598] [2024-10-11 02:50:09,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964803598] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:09,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916304209] [2024-10-11 02:50:09,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:09,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:09,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:09,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:09,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:50:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:50:10,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:50:10,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:10,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916304209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:10,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:10,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-11 02:50:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866920724] [2024-10-11 02:50:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:10,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:50:10,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:10,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:50:10,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:50:10,078 INFO L87 Difference]: Start difference. First operand has 397 states, 302 states have (on average 1.6026490066225165) internal successors, (484), 307 states have internal predecessors, (484), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:10,162 INFO L93 Difference]: Finished difference Result 610 states and 927 transitions. [2024-10-11 02:50:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:50:10,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2024-10-11 02:50:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:10,179 INFO L225 Difference]: With dead ends: 610 [2024-10-11 02:50:10,180 INFO L226 Difference]: Without dead ends: 394 [2024-10-11 02:50:10,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 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-10-11 02:50:10,188 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:10,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:50:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-11 02:50:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-10-11 02:50:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 300 states have (on average 1.59) internal successors, (477), 304 states have internal predecessors, (477), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 02:50:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 606 transitions. [2024-10-11 02:50:10,243 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 606 transitions. Word has length 110 [2024-10-11 02:50:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:10,245 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 606 transitions. [2024-10-11 02:50:10,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 606 transitions. [2024-10-11 02:50:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 02:50:10,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:10,250 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:10,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:50:10,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:50:10,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:10,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash 404477880, now seen corresponding path program 1 times [2024-10-11 02:50:10,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:10,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465554985] [2024-10-11 02:50:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:50:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:50:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:50:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:50:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:50:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:50:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:50:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:50:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:50:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:50:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:50:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:50:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 02:50:10,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:10,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465554985] [2024-10-11 02:50:10,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465554985] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:10,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268982960] [2024-10-11 02:50:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:10,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:10,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:10,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:10,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:50:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:50:11,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:50:11,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268982960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:11,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:50:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380672641] [2024-10-11 02:50:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:11,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:50:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:50:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:50:11,075 INFO L87 Difference]: Start difference. First operand 394 states and 606 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:11,147 INFO L93 Difference]: Finished difference Result 606 states and 911 transitions. [2024-10-11 02:50:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:50:11,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-10-11 02:50:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:11,154 INFO L225 Difference]: With dead ends: 606 [2024-10-11 02:50:11,154 INFO L226 Difference]: Without dead ends: 396 [2024-10-11 02:50:11,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:50:11,156 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 0 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:11,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1183 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:50:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-11 02:50:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-11 02:50:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 302 states have (on average 1.586092715231788) internal successors, (479), 306 states have internal predecessors, (479), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 02:50:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 608 transitions. [2024-10-11 02:50:11,181 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 608 transitions. Word has length 111 [2024-10-11 02:50:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:11,181 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 608 transitions. [2024-10-11 02:50:11,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 608 transitions. [2024-10-11 02:50:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 02:50:11,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:11,185 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:11,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 02:50:11,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:11,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:11,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1052312599, now seen corresponding path program 1 times [2024-10-11 02:50:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:11,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669940623] [2024-10-11 02:50:11,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:50:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:50:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:50:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:50:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:50:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:50:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:50:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:50:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:50:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:50:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:50:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:50:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:50:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:50:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 02:50:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:50:11,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:11,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669940623] [2024-10-11 02:50:11,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669940623] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:11,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600758390] [2024-10-11 02:50:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:11,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:11,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:11,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:11,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:50:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:11,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:50:11,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 02:50:11,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600758390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:11,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:50:11,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302164047] [2024-10-11 02:50:11,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:11,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:50:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:50:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:50:11,896 INFO L87 Difference]: Start difference. First operand 396 states and 608 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:11,950 INFO L93 Difference]: Finished difference Result 840 states and 1308 transitions. [2024-10-11 02:50:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:50:11,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2024-10-11 02:50:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:11,954 INFO L225 Difference]: With dead ends: 840 [2024-10-11 02:50:11,955 INFO L226 Difference]: Without dead ends: 466 [2024-10-11 02:50:11,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:50:11,957 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 129 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:11,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1159 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:50:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-11 02:50:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 461. [2024-10-11 02:50:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 353 states have (on average 1.6033994334277621) internal successors, (566), 357 states have internal predecessors, (566), 79 states have call successors, (79), 28 states have call predecessors, (79), 28 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 02:50:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 723 transitions. [2024-10-11 02:50:11,984 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 723 transitions. Word has length 136 [2024-10-11 02:50:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:11,985 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 723 transitions. [2024-10-11 02:50:11,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 723 transitions. [2024-10-11 02:50:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 02:50:11,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:11,988 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:12,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:50:12,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:12,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:12,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:12,191 INFO L85 PathProgramCache]: Analyzing trace with hash 944776721, now seen corresponding path program 1 times [2024-10-11 02:50:12,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:12,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391076895] [2024-10-11 02:50:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:12,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:50:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:50:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:50:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:50:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:50:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:50:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:50:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:50:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:50:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:50:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:50:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:50:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:50:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:50:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 02:50:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:50:12,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:12,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391076895] [2024-10-11 02:50:12,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391076895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:12,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762401656] [2024-10-11 02:50:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:12,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:12,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:12,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:12,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:50:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:12,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:50:12,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 02:50:12,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762401656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:12,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 02:50:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757495146] [2024-10-11 02:50:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:12,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:50:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:50:12,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:50:12,895 INFO L87 Difference]: Start difference. First operand 461 states and 723 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:50:12,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:12,980 INFO L93 Difference]: Finished difference Result 917 states and 1440 transitions. [2024-10-11 02:50:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:50:12,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 137 [2024-10-11 02:50:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:12,984 INFO L225 Difference]: With dead ends: 917 [2024-10-11 02:50:12,984 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 02:50:12,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:50:12,986 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 2 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:12,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2325 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:50:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 02:50:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2024-10-11 02:50:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 354 states have (on average 1.6016949152542372) internal successors, (567), 359 states have internal predecessors, (567), 79 states have call successors, (79), 28 states have call predecessors, (79), 29 states have return successors, (80), 77 states have call predecessors, (80), 78 states have call successors, (80) [2024-10-11 02:50:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 726 transitions. [2024-10-11 02:50:13,014 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 726 transitions. Word has length 137 [2024-10-11 02:50:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:13,014 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 726 transitions. [2024-10-11 02:50:13,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:50:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 726 transitions. [2024-10-11 02:50:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 02:50:13,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:13,017 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:13,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:50:13,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:13,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:13,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash 287630294, now seen corresponding path program 1 times [2024-10-11 02:50:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:13,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365648198] [2024-10-11 02:50:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:50:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:50:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:50:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:50:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:50:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:50:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:50:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:50:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:50:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:50:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:50:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:50:13,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:13,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365648198] [2024-10-11 02:50:13,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365648198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:13,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3400907] [2024-10-11 02:50:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:13,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:13,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:13,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:13,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:50:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:13,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:50:13,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 02:50:13,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:13,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3400907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:13,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:13,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:50:13,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585032483] [2024-10-11 02:50:13,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:13,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:50:13,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:13,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:50:13,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:50:13,740 INFO L87 Difference]: Start difference. First operand 463 states and 726 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:50:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:13,817 INFO L93 Difference]: Finished difference Result 919 states and 1445 transitions. [2024-10-11 02:50:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:50:13,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2024-10-11 02:50:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:13,820 INFO L225 Difference]: With dead ends: 919 [2024-10-11 02:50:13,820 INFO L226 Difference]: Without dead ends: 465 [2024-10-11 02:50:13,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:50:13,822 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 2 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:13,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2311 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:50:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-11 02:50:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2024-10-11 02:50:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 355 states have (on average 1.6) internal successors, (568), 361 states have internal predecessors, (568), 79 states have call successors, (79), 28 states have call predecessors, (79), 30 states have return successors, (85), 77 states have call predecessors, (85), 78 states have call successors, (85) [2024-10-11 02:50:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 732 transitions. [2024-10-11 02:50:13,866 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 732 transitions. Word has length 120 [2024-10-11 02:50:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:13,867 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 732 transitions. [2024-10-11 02:50:13,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:50:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 732 transitions. [2024-10-11 02:50:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 02:50:13,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:13,869 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:13,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 02:50:14,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:14,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:14,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash 333579990, now seen corresponding path program 1 times [2024-10-11 02:50:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:14,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227872762] [2024-10-11 02:50:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:50:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:50:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:50:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:50:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:50:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:50:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:50:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:50:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:50:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:50:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:50:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 02:50:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:50:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:50:14,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:14,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227872762] [2024-10-11 02:50:14,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227872762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:14,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:50:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41378556] [2024-10-11 02:50:14,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:14,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:50:14,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:50:14,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:50:14,300 INFO L87 Difference]: Start difference. First operand 465 states and 732 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:50:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:16,180 INFO L93 Difference]: Finished difference Result 1016 states and 1632 transitions. [2024-10-11 02:50:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:50:16,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 139 [2024-10-11 02:50:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:16,184 INFO L225 Difference]: With dead ends: 1016 [2024-10-11 02:50:16,184 INFO L226 Difference]: Without dead ends: 570 [2024-10-11 02:50:16,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:50:16,186 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1349 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:16,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 1198 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 2632 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:50:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-11 02:50:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 465. [2024-10-11 02:50:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 355 states have (on average 1.6) internal successors, (568), 361 states have internal predecessors, (568), 79 states have call successors, (79), 28 states have call predecessors, (79), 30 states have return successors, (84), 77 states have call predecessors, (84), 78 states have call successors, (84) [2024-10-11 02:50:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 731 transitions. [2024-10-11 02:50:16,216 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 731 transitions. Word has length 139 [2024-10-11 02:50:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:16,216 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 731 transitions. [2024-10-11 02:50:16,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:50:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 731 transitions. [2024-10-11 02:50:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 02:50:16,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:16,219 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:16,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:50:16,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:16,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:16,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1187156544, now seen corresponding path program 2 times [2024-10-11 02:50:16,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:16,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877935368] [2024-10-11 02:50:16,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:16,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:50:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:50:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:50:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:50:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:50:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:50:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:50:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:50:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:50:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:50:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:50:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:50:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 02:50:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:50:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877935368] [2024-10-11 02:50:16,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877935368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:16,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:16,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:50:16,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652036763] [2024-10-11 02:50:16,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:16,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:50:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:16,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:50:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:50:16,383 INFO L87 Difference]: Start difference. First operand 465 states and 731 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:50:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:18,191 INFO L93 Difference]: Finished difference Result 1018 states and 1635 transitions. [2024-10-11 02:50:18,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:50:18,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 140 [2024-10-11 02:50:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:18,195 INFO L225 Difference]: With dead ends: 1018 [2024-10-11 02:50:18,195 INFO L226 Difference]: Without dead ends: 572 [2024-10-11 02:50:18,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:50:18,197 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1344 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 3128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:18,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1199 Invalid, 3128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:50:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-11 02:50:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 467. [2024-10-11 02:50:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 356 states have (on average 1.598314606741573) internal successors, (569), 363 states have internal predecessors, (569), 79 states have call successors, (79), 28 states have call predecessors, (79), 31 states have return successors, (86), 77 states have call predecessors, (86), 78 states have call successors, (86) [2024-10-11 02:50:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 734 transitions. [2024-10-11 02:50:18,251 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 734 transitions. Word has length 140 [2024-10-11 02:50:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:18,251 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 734 transitions. [2024-10-11 02:50:18,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:50:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 734 transitions. [2024-10-11 02:50:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 02:50:18,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:18,253 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:18,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:50:18,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:18,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:18,254 INFO L85 PathProgramCache]: Analyzing trace with hash -718235493, now seen corresponding path program 1 times [2024-10-11 02:50:18,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:18,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986754187] [2024-10-11 02:50:18,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:50:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:50:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:50:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:50:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:50:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:50:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:50:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:50:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:50:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:50:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:50:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 02:50:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:50:18,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:18,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986754187] [2024-10-11 02:50:18,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986754187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:18,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:18,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:50:18,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893289993] [2024-10-11 02:50:18,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:18,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:50:18,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:18,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:50:18,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:50:18,438 INFO L87 Difference]: Start difference. First operand 467 states and 734 transitions. Second operand has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 02:50:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:21,191 INFO L93 Difference]: Finished difference Result 1016 states and 1630 transitions. [2024-10-11 02:50:21,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:50:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2024-10-11 02:50:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:21,195 INFO L225 Difference]: With dead ends: 1016 [2024-10-11 02:50:21,195 INFO L226 Difference]: Without dead ends: 572 [2024-10-11 02:50:21,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:50:21,197 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1350 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 4437 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 4908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 4437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:21,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 1663 Invalid, 4908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 4437 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:50:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-11 02:50:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 467. [2024-10-11 02:50:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 356 states have (on average 1.598314606741573) internal successors, (569), 363 states have internal predecessors, (569), 79 states have call successors, (79), 28 states have call predecessors, (79), 31 states have return successors, (85), 77 states have call predecessors, (85), 78 states have call successors, (85) [2024-10-11 02:50:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 733 transitions. [2024-10-11 02:50:21,220 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 733 transitions. Word has length 141 [2024-10-11 02:50:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:21,220 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 733 transitions. [2024-10-11 02:50:21,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 02:50:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 733 transitions. [2024-10-11 02:50:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 02:50:21,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:21,222 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:21,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:50:21,222 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:21,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:21,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1237808725, now seen corresponding path program 1 times [2024-10-11 02:50:21,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:21,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706994354] [2024-10-11 02:50:21,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:21,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:50:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:50:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:50:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:50:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:50:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:50:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:50:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:50:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:50:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:50:21,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706994354] [2024-10-11 02:50:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706994354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:21,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:21,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:50:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708107867] [2024-10-11 02:50:21,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:21,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:50:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:21,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:50:21,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:50:21,399 INFO L87 Difference]: Start difference. First operand 467 states and 733 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 02:50:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:23,745 INFO L93 Difference]: Finished difference Result 1018 states and 1636 transitions. [2024-10-11 02:50:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:50:23,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 124 [2024-10-11 02:50:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:23,748 INFO L225 Difference]: With dead ends: 1018 [2024-10-11 02:50:23,749 INFO L226 Difference]: Without dead ends: 574 [2024-10-11 02:50:23,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:50:23,751 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1348 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 4442 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 4923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 4442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:23,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 1664 Invalid, 4923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 4442 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 02:50:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-11 02:50:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 469. [2024-10-11 02:50:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 357 states have (on average 1.596638655462185) internal successors, (570), 365 states have internal predecessors, (570), 79 states have call successors, (79), 28 states have call predecessors, (79), 32 states have return successors, (90), 77 states have call predecessors, (90), 78 states have call successors, (90) [2024-10-11 02:50:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 739 transitions. [2024-10-11 02:50:23,814 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 739 transitions. Word has length 124 [2024-10-11 02:50:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:23,815 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 739 transitions. [2024-10-11 02:50:23,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 02:50:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 739 transitions. [2024-10-11 02:50:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 02:50:23,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:23,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:23,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:50:23,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:23,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1503347968, now seen corresponding path program 1 times [2024-10-11 02:50:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:23,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613091646] [2024-10-11 02:50:23,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:23,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:23,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:23,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:50:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:50:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:50:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:50:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:50:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:50:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:50:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:50:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:50:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:50:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 02:50:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 02:50:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-11 02:50:24,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:24,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613091646] [2024-10-11 02:50:24,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613091646] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:24,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260035926] [2024-10-11 02:50:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:24,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:24,035 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:24,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:50:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:24,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:50:24,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:50:24,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:50:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:50:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260035926] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:50:24,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:50:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-11 02:50:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733193983] [2024-10-11 02:50:24,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:50:24,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 02:50:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:24,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 02:50:24,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:50:24,471 INFO L87 Difference]: Start difference. First operand 469 states and 739 transitions. Second operand has 15 states, 14 states have (on average 10.142857142857142) internal successors, (142), 11 states have internal predecessors, (142), 4 states have call successors, (43), 6 states have call predecessors, (43), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-11 02:50:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:27,119 INFO L93 Difference]: Finished difference Result 1437 states and 2412 transitions. [2024-10-11 02:50:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 02:50:27,120 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.142857142857142) internal successors, (142), 11 states have internal predecessors, (142), 4 states have call successors, (43), 6 states have call predecessors, (43), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 143 [2024-10-11 02:50:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:27,127 INFO L225 Difference]: With dead ends: 1437 [2024-10-11 02:50:27,127 INFO L226 Difference]: Without dead ends: 994 [2024-10-11 02:50:27,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:50:27,130 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 2813 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 4268 mSolverCounterSat, 913 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2834 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 5181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 913 IncrementalHoareTripleChecker+Valid, 4268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:27,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2834 Valid, 1834 Invalid, 5181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [913 Valid, 4268 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:50:27,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-10-11 02:50:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 874. [2024-10-11 02:50:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 683 states have (on average 1.644216691068814) internal successors, (1123), 691 states have internal predecessors, (1123), 158 states have call successors, (158), 28 states have call predecessors, (158), 32 states have return successors, (179), 156 states have call predecessors, (179), 157 states have call successors, (179) [2024-10-11 02:50:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1460 transitions. [2024-10-11 02:50:27,169 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1460 transitions. Word has length 143 [2024-10-11 02:50:27,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:27,170 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1460 transitions. [2024-10-11 02:50:27,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.142857142857142) internal successors, (142), 11 states have internal predecessors, (142), 4 states have call successors, (43), 6 states have call predecessors, (43), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-11 02:50:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1460 transitions. [2024-10-11 02:50:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 02:50:27,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:27,174 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:27,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:50:27,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:50:27,379 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:27,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1361474097, now seen corresponding path program 1 times [2024-10-11 02:50:27,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:27,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299073859] [2024-10-11 02:50:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:50:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:50:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:50:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:50:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:50:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:50:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:50:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:50:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:50:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:50:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 02:50:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 02:50:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:50:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299073859] [2024-10-11 02:50:27,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299073859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:27,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:27,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:50:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596004105] [2024-10-11 02:50:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:27,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:50:27,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:50:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:50:27,580 INFO L87 Difference]: Start difference. First operand 874 states and 1460 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:28,906 INFO L93 Difference]: Finished difference Result 2172 states and 3731 transitions. [2024-10-11 02:50:28,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:28,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2024-10-11 02:50:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:28,914 INFO L225 Difference]: With dead ends: 2172 [2024-10-11 02:50:28,914 INFO L226 Difference]: Without dead ends: 1366 [2024-10-11 02:50:28,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:50:28,917 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1472 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:28,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 893 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:50:28,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2024-10-11 02:50:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1256. [2024-10-11 02:50:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 986 states have (on average 1.658215010141988) internal successors, (1635), 994 states have internal predecessors, (1635), 237 states have call successors, (237), 28 states have call predecessors, (237), 32 states have return successors, (268), 235 states have call predecessors, (268), 236 states have call successors, (268) [2024-10-11 02:50:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2140 transitions. [2024-10-11 02:50:28,963 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2140 transitions. Word has length 147 [2024-10-11 02:50:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:28,964 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 2140 transitions. [2024-10-11 02:50:28,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2140 transitions. [2024-10-11 02:50:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 02:50:28,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:28,969 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:50:28,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:50:28,969 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:28,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1029874567, now seen corresponding path program 1 times [2024-10-11 02:50:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:28,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047220729] [2024-10-11 02:50:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:50:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:50:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:50:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:50:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:50:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:50:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:50:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:50:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:50:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:29,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:29,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047220729] [2024-10-11 02:50:29,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047220729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:29,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:29,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:50:29,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291942146] [2024-10-11 02:50:29,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:29,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:50:29,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:29,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:50:29,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:50:29,107 INFO L87 Difference]: Start difference. First operand 1256 states and 2140 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:30,417 INFO L93 Difference]: Finished difference Result 3123 states and 5417 transitions. [2024-10-11 02:50:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:30,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-10-11 02:50:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:30,427 INFO L225 Difference]: With dead ends: 3123 [2024-10-11 02:50:30,427 INFO L226 Difference]: Without dead ends: 1985 [2024-10-11 02:50:30,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:50:30,432 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1472 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:30,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 874 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:50:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2024-10-11 02:50:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1875. [2024-10-11 02:50:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1486 states have (on average 1.6655450874831763) internal successors, (2475), 1494 states have internal predecessors, (2475), 356 states have call successors, (356), 28 states have call predecessors, (356), 32 states have return successors, (387), 354 states have call predecessors, (387), 355 states have call successors, (387) [2024-10-11 02:50:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 3218 transitions. [2024-10-11 02:50:30,504 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 3218 transitions. Word has length 130 [2024-10-11 02:50:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:30,505 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 3218 transitions. [2024-10-11 02:50:30,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 3218 transitions. [2024-10-11 02:50:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 02:50:30,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:30,513 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:30,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:50:30,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:30,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash -521862625, now seen corresponding path program 1 times [2024-10-11 02:50:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:30,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952707465] [2024-10-11 02:50:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:50:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:50:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:50:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:50:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:50:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:50:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:50:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:50:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:50:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 02:50:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 02:50:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 02:50:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:50:30,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952707465] [2024-10-11 02:50:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952707465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:30,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:50:30,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072306802] [2024-10-11 02:50:30,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:30,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:50:30,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:30,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:50:30,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:50:30,647 INFO L87 Difference]: Start difference. First operand 1875 states and 3218 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:31,974 INFO L93 Difference]: Finished difference Result 4563 states and 7988 transitions. [2024-10-11 02:50:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2024-10-11 02:50:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:31,987 INFO L225 Difference]: With dead ends: 4563 [2024-10-11 02:50:31,987 INFO L226 Difference]: Without dead ends: 2934 [2024-10-11 02:50:31,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:50:31,993 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1471 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:31,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 871 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:50:31,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2024-10-11 02:50:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2824. [2024-10-11 02:50:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2824 states, 2273 states have (on average 1.6717993840739112) internal successors, (3800), 2281 states have internal predecessors, (3800), 518 states have call successors, (518), 28 states have call predecessors, (518), 32 states have return successors, (565), 516 states have call predecessors, (565), 517 states have call successors, (565) [2024-10-11 02:50:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 4883 transitions. [2024-10-11 02:50:32,119 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 4883 transitions. Word has length 149 [2024-10-11 02:50:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:32,119 INFO L471 AbstractCegarLoop]: Abstraction has 2824 states and 4883 transitions. [2024-10-11 02:50:32,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 4883 transitions. [2024-10-11 02:50:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 02:50:32,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:32,131 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:50:32,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:50:32,131 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:32,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash -409937400, now seen corresponding path program 1 times [2024-10-11 02:50:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061597967] [2024-10-11 02:50:32,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:50:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:50:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:50:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:50:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:50:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:50:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:50:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:50:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 02:50:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:32,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061597967] [2024-10-11 02:50:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061597967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:32,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:50:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279972441] [2024-10-11 02:50:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:50:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:32,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:50:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:50:32,221 INFO L87 Difference]: Start difference. First operand 2824 states and 4883 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:33,731 INFO L93 Difference]: Finished difference Result 6835 states and 12056 transitions. [2024-10-11 02:50:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:33,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-10-11 02:50:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:33,750 INFO L225 Difference]: With dead ends: 6835 [2024-10-11 02:50:33,750 INFO L226 Difference]: Without dead ends: 4466 [2024-10-11 02:50:33,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:50:33,758 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1467 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:33,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 872 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:50:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4466 states. [2024-10-11 02:50:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4466 to 4356. [2024-10-11 02:50:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4356 states, 3560 states have (on average 1.6764044943820224) internal successors, (5968), 3568 states have internal predecessors, (5968), 763 states have call successors, (763), 28 states have call predecessors, (763), 32 states have return successors, (836), 761 states have call predecessors, (836), 762 states have call successors, (836) [2024-10-11 02:50:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4356 states to 4356 states and 7567 transitions. [2024-10-11 02:50:33,925 INFO L78 Accepts]: Start accepts. Automaton has 4356 states and 7567 transitions. Word has length 132 [2024-10-11 02:50:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:33,926 INFO L471 AbstractCegarLoop]: Abstraction has 4356 states and 7567 transitions. [2024-10-11 02:50:33,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4356 states and 7567 transitions. [2024-10-11 02:50:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 02:50:33,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:33,939 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:33,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:50:33,939 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:33,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash 502607419, now seen corresponding path program 1 times [2024-10-11 02:50:33,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:33,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77315162] [2024-10-11 02:50:33,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:33,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:50:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:50:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:50:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:50:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:50:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:50:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:50:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:50:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:50:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 02:50:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 02:50:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 02:50:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:50:34,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:34,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77315162] [2024-10-11 02:50:34,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77315162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:34,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:34,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:50:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860805297] [2024-10-11 02:50:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:34,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:50:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:34,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:50:34,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:50:34,041 INFO L87 Difference]: Start difference. First operand 4356 states and 7567 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:35,532 INFO L93 Difference]: Finished difference Result 10888 states and 19267 transitions. [2024-10-11 02:50:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:35,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2024-10-11 02:50:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:35,569 INFO L225 Difference]: With dead ends: 10888 [2024-10-11 02:50:35,569 INFO L226 Difference]: Without dead ends: 7226 [2024-10-11 02:50:35,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:50:35,582 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1467 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:35,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 896 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:50:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7226 states. [2024-10-11 02:50:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7226 to 7116. [2024-10-11 02:50:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7116 states, 5827 states have (on average 1.6722155483095933) internal successors, (9744), 5835 states have internal predecessors, (9744), 1256 states have call successors, (1256), 28 states have call predecessors, (1256), 32 states have return successors, (1373), 1254 states have call predecessors, (1373), 1255 states have call successors, (1373) [2024-10-11 02:50:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7116 states to 7116 states and 12373 transitions. [2024-10-11 02:50:35,910 INFO L78 Accepts]: Start accepts. Automaton has 7116 states and 12373 transitions. Word has length 151 [2024-10-11 02:50:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:35,910 INFO L471 AbstractCegarLoop]: Abstraction has 7116 states and 12373 transitions. [2024-10-11 02:50:35,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 7116 states and 12373 transitions. [2024-10-11 02:50:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 02:50:35,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:35,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:50:35,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:50:35,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:35,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1472860436, now seen corresponding path program 1 times [2024-10-11 02:50:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:35,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032533544] [2024-10-11 02:50:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:35,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:50:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:50:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:50:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:50:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:50:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:50:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:50:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:50:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:50:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:36,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:36,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032533544] [2024-10-11 02:50:36,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032533544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:36,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:50:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138824323] [2024-10-11 02:50:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:36,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:50:36,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:36,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:50:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:50:36,030 INFO L87 Difference]: Start difference. First operand 7116 states and 12373 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:37,592 INFO L93 Difference]: Finished difference Result 18091 states and 32014 transitions. [2024-10-11 02:50:37,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:37,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-10-11 02:50:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:37,636 INFO L225 Difference]: With dead ends: 18091 [2024-10-11 02:50:37,636 INFO L226 Difference]: Without dead ends: 12055 [2024-10-11 02:50:37,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:50:37,654 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1462 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:37,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 880 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:50:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12055 states. [2024-10-11 02:50:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12055 to 11945. [2024-10-11 02:50:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11945 states, 9834 states have (on average 1.6722595078299776) internal successors, (16445), 9842 states have internal predecessors, (16445), 2078 states have call successors, (2078), 28 states have call predecessors, (2078), 32 states have return successors, (2273), 2076 states have call predecessors, (2273), 2077 states have call successors, (2273) [2024-10-11 02:50:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11945 states to 11945 states and 20796 transitions. [2024-10-11 02:50:38,254 INFO L78 Accepts]: Start accepts. Automaton has 11945 states and 20796 transitions. Word has length 134 [2024-10-11 02:50:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:38,255 INFO L471 AbstractCegarLoop]: Abstraction has 11945 states and 20796 transitions. [2024-10-11 02:50:38,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 11945 states and 20796 transitions. [2024-10-11 02:50:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 02:50:38,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:38,293 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:38,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:50:38,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:38,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:38,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1871346461, now seen corresponding path program 1 times [2024-10-11 02:50:38,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:38,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447723648] [2024-10-11 02:50:38,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:38,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:50:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:50:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:50:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:50:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:50:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:50:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:50:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:50:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:50:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 02:50:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 02:50:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 02:50:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:50:38,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:38,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447723648] [2024-10-11 02:50:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447723648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:38,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:50:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129252487] [2024-10-11 02:50:38,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:38,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:50:38,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:38,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:50:38,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:50:38,409 INFO L87 Difference]: Start difference. First operand 11945 states and 20796 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:40,160 INFO L93 Difference]: Finished difference Result 28637 states and 50462 transitions. [2024-10-11 02:50:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-10-11 02:50:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:40,231 INFO L225 Difference]: With dead ends: 28637 [2024-10-11 02:50:40,232 INFO L226 Difference]: Without dead ends: 18727 [2024-10-11 02:50:40,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:50:40,265 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1460 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:40,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 848 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:50:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18727 states. [2024-10-11 02:50:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18727 to 18617. [2024-10-11 02:50:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18617 states, 15303 states have (on average 1.6489577207083579) internal successors, (25234), 15311 states have internal predecessors, (25234), 3281 states have call successors, (3281), 28 states have call predecessors, (3281), 32 states have return successors, (3620), 3279 states have call predecessors, (3620), 3280 states have call successors, (3620) [2024-10-11 02:50:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 32135 transitions. [2024-10-11 02:50:40,903 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 32135 transitions. Word has length 153 [2024-10-11 02:50:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:40,904 INFO L471 AbstractCegarLoop]: Abstraction has 18617 states and 32135 transitions. [2024-10-11 02:50:40,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 32135 transitions. [2024-10-11 02:50:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 02:50:40,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:40,931 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:40,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:50:40,932 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:40,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1155671724, now seen corresponding path program 1 times [2024-10-11 02:50:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382387725] [2024-10-11 02:50:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:40,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:40,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:40,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:40,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:40,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:40,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:50:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:50:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:50:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:50:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:50:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:50:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:50:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:50:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:50:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 02:50:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 02:50:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 02:50:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:50:41,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:41,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382387725] [2024-10-11 02:50:41,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382387725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:41,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:41,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:50:41,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437024436] [2024-10-11 02:50:41,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:41,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:50:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:50:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:50:41,025 INFO L87 Difference]: Start difference. First operand 18617 states and 32135 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:43,432 INFO L93 Difference]: Finished difference Result 49270 states and 86581 transitions. [2024-10-11 02:50:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:43,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 154 [2024-10-11 02:50:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:43,529 INFO L225 Difference]: With dead ends: 49270 [2024-10-11 02:50:43,530 INFO L226 Difference]: Without dead ends: 33308 [2024-10-11 02:50:43,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:50:43,562 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1455 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:43,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 880 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:50:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33308 states. [2024-10-11 02:50:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33308 to 33198. [2024-10-11 02:50:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33198 states, 27434 states have (on average 1.6461325362688635) internal successors, (45160), 27442 states have internal predecessors, (45160), 5731 states have call successors, (5731), 28 states have call predecessors, (5731), 32 states have return successors, (6344), 5729 states have call predecessors, (6344), 5730 states have call successors, (6344) [2024-10-11 02:50:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33198 states to 33198 states and 57235 transitions. [2024-10-11 02:50:44,680 INFO L78 Accepts]: Start accepts. Automaton has 33198 states and 57235 transitions. Word has length 154 [2024-10-11 02:50:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:44,680 INFO L471 AbstractCegarLoop]: Abstraction has 33198 states and 57235 transitions. [2024-10-11 02:50:44,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 33198 states and 57235 transitions. [2024-10-11 02:50:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 02:50:44,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:44,711 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:44,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:50:44,711 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:44,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:44,712 INFO L85 PathProgramCache]: Analyzing trace with hash 406994199, now seen corresponding path program 1 times [2024-10-11 02:50:44,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:44,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80286776] [2024-10-11 02:50:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:50:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:50:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:50:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:50:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:50:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:50:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:50:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:50:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:50:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 02:50:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 02:50:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 02:50:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:50:44,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:44,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80286776] [2024-10-11 02:50:44,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80286776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:44,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:44,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:50:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796144415] [2024-10-11 02:50:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:44,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:50:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:44,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:50:44,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:50:44,820 INFO L87 Difference]: Start difference. First operand 33198 states and 57235 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:47,797 INFO L93 Difference]: Finished difference Result 90572 states and 158410 transitions. [2024-10-11 02:50:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2024-10-11 02:50:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:48,022 INFO L225 Difference]: With dead ends: 90572 [2024-10-11 02:50:48,023 INFO L226 Difference]: Without dead ends: 60920 [2024-10-11 02:50:48,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:50:48,098 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1458 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:48,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 885 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:50:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60920 states. [2024-10-11 02:50:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60920 to 60810. [2024-10-11 02:50:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60810 states, 50533 states have (on average 1.6422931549680406) internal successors, (82990), 50541 states have internal predecessors, (82990), 10244 states have call successors, (10244), 28 states have call predecessors, (10244), 32 states have return successors, (11389), 10242 states have call predecessors, (11389), 10243 states have call successors, (11389) [2024-10-11 02:50:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60810 states to 60810 states and 104623 transitions. [2024-10-11 02:50:50,553 INFO L78 Accepts]: Start accepts. Automaton has 60810 states and 104623 transitions. Word has length 155 [2024-10-11 02:50:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:50,553 INFO L471 AbstractCegarLoop]: Abstraction has 60810 states and 104623 transitions. [2024-10-11 02:50:50,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:50:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 60810 states and 104623 transitions. [2024-10-11 02:50:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 02:50:50,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:50,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:50:50,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:50:50,599 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:50,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -287950899, now seen corresponding path program 1 times [2024-10-11 02:50:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:50,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503298501] [2024-10-11 02:50:50,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:50:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:50:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:50:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:50:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:50:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:50:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:50:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:50:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 02:50:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:50,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503298501] [2024-10-11 02:50:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503298501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:50,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:50,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:50:50,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657576823] [2024-10-11 02:50:50,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:50,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:50:50,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:50,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:50:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:50:50,698 INFO L87 Difference]: Start difference. First operand 60810 states and 104623 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:54,882 INFO L93 Difference]: Finished difference Result 113924 states and 199763 transitions. [2024-10-11 02:50:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:54,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2024-10-11 02:50:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:55,492 INFO L225 Difference]: With dead ends: 113924 [2024-10-11 02:50:55,493 INFO L226 Difference]: Without dead ends: 113714 [2024-10-11 02:50:55,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:50:55,546 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1450 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:55,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 887 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:50:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113714 states. [2024-10-11 02:50:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113714 to 113604. [2024-10-11 02:50:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113604 states, 94959 states have (on average 1.637327688792005) internal successors, (155479), 94967 states have internal predecessors, (155479), 18612 states have call successors, (18612), 28 states have call predecessors, (18612), 32 states have return successors, (20803), 18610 states have call predecessors, (20803), 18611 states have call successors, (20803) [2024-10-11 02:50:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113604 states to 113604 states and 194894 transitions. [2024-10-11 02:50:59,926 INFO L78 Accepts]: Start accepts. Automaton has 113604 states and 194894 transitions. Word has length 138 [2024-10-11 02:50:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:59,927 INFO L471 AbstractCegarLoop]: Abstraction has 113604 states and 194894 transitions. [2024-10-11 02:50:59,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:50:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 113604 states and 194894 transitions. [2024-10-11 02:51:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 02:51:00,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:00,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:51:00,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:51:00,052 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:00,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash -951979594, now seen corresponding path program 1 times [2024-10-11 02:51:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808946638] [2024-10-11 02:51:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:00,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:51:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:51:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:51:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:51:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:51:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:51:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:51:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:51:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:51:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 02:51:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 02:51:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 02:51:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:51:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:00,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808946638] [2024-10-11 02:51:00,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808946638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:00,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:00,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:51:00,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706271429] [2024-10-11 02:51:00,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:00,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:51:00,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:00,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:51:00,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:51:00,206 INFO L87 Difference]: Start difference. First operand 113604 states and 194894 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:51:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:07,831 INFO L93 Difference]: Finished difference Result 218790 states and 383189 transitions. [2024-10-11 02:51:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 02:51:07,831 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 157 [2024-10-11 02:51:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:08,780 INFO L225 Difference]: With dead ends: 218790 [2024-10-11 02:51:08,780 INFO L226 Difference]: Without dead ends: 218587 [2024-10-11 02:51:08,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2024-10-11 02:51:08,886 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 3031 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 3497 mSolverCounterSat, 969 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 4466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 969 IncrementalHoareTripleChecker+Valid, 3497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:08,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3048 Valid, 1557 Invalid, 4466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [969 Valid, 3497 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 02:51:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218587 states. [2024-10-11 02:51:16,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218587 to 218371. [2024-10-11 02:51:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218371 states, 182584 states have (on average 1.6406640231345573) internal successors, (299559), 182540 states have internal predecessors, (299559), 35726 states have call successors, (35726), 55 states have call predecessors, (35726), 60 states have return successors, (39009), 35779 states have call predecessors, (39009), 35724 states have call successors, (39009) [2024-10-11 02:51:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218371 states to 218371 states and 374294 transitions. [2024-10-11 02:51:17,904 INFO L78 Accepts]: Start accepts. Automaton has 218371 states and 374294 transitions. Word has length 157 [2024-10-11 02:51:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:17,905 INFO L471 AbstractCegarLoop]: Abstraction has 218371 states and 374294 transitions. [2024-10-11 02:51:17,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:51:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 218371 states and 374294 transitions. [2024-10-11 02:51:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 02:51:17,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:17,976 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:51:17,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:51:17,976 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:17,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1906564041, now seen corresponding path program 1 times [2024-10-11 02:51:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562999138] [2024-10-11 02:51:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:51:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:51:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:51:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:51:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:51:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:51:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:51:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:51:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:51:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 02:51:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 02:51:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 02:51:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:51:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562999138] [2024-10-11 02:51:18,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562999138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:18,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:18,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 02:51:18,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137338485] [2024-10-11 02:51:18,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:18,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:51:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:18,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:51:18,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:51:18,185 INFO L87 Difference]: Start difference. First operand 218371 states and 374294 transitions. Second operand has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 8 states have internal predecessors, (97), 5 states have call successors, (21), 8 states have call predecessors, (21), 2 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18)