./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_spec6_product20.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_spec6_product20.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 d4216ddf014ff953368f9c10444517e5ad475a960f2c91abb81cda95e6b2b3bf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:50:53,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:50:53,848 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:53,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:50:53,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:50:53,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:50:53,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:50:53,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:50:53,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:50:53,880 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:50:53,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:50:53,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:50:53,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:50:53,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:50:53,885 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:50:53,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:50:53,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:50:53,886 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:50:53,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:50:53,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:50:53,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:50:53,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:50:53,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:50:53,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:50:53,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:50:53,888 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:50:53,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:50:53,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:50:53,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:50:53,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:50:53,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:50:53,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:50:53,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:50:53,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:50:53,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:50:53,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:50:53,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:50:53,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:50:53,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:50:53,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:50:53,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:50:53,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:50:53,892 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 -> d4216ddf014ff953368f9c10444517e5ad475a960f2c91abb81cda95e6b2b3bf [2024-10-11 02:50:54,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:50:54,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:50:54,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:50:54,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:50:54,152 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:50:54,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product20.cil.c [2024-10-11 02:50:55,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:50:55,615 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:50:55,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product20.cil.c [2024-10-11 02:50:55,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/de862098a/f330eec54f344c6dbbf5c6f672f5ac41/FLAG4b0591082 [2024-10-11 02:50:55,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/de862098a/f330eec54f344c6dbbf5c6f672f5ac41 [2024-10-11 02:50:55,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:50:55,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:50:55,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:50:55,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:50:55,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:50:55,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:50:55" (1/1) ... [2024-10-11 02:50:55,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fac54df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:55, skipping insertion in model container [2024-10-11 02:50:55,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:50:55" (1/1) ... [2024-10-11 02:50:55,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:50:56,224 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_spec6_product20.cil.c[56376,56389] [2024-10-11 02:50:56,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:50:56,276 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:50:56,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-11 02:50:56,287 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [97] [2024-10-11 02:50:56,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [326] [2024-10-11 02:50:56,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1406] [2024-10-11 02:50:56,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1772] [2024-10-11 02:50:56,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [2184] [2024-10-11 02:50:56,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2234] [2024-10-11 02:50:56,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2528] [2024-10-11 02:50:56,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2537] [2024-10-11 02:50:56,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2846] [2024-10-11 02:50:56,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2863] [2024-10-11 02:50:56,367 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_spec6_product20.cil.c[56376,56389] [2024-10-11 02:50:56,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:50:56,410 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:50:56,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:56 WrapperNode [2024-10-11 02:50:56,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:50:56,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:50:56,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:50:56,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:50:56,416 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:56" (1/1) ... [2024-10-11 02:50:56,437 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:56" (1/1) ... [2024-10-11 02:50:56,476 INFO L138 Inliner]: procedures = 129, calls = 202, calls flagged for inlining = 54, calls inlined = 47, statements flattened = 940 [2024-10-11 02:50:56,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:50:56,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:50:56,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:50:56,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:50:56,488 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:56" (1/1) ... [2024-10-11 02:50:56,489 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:56" (1/1) ... [2024-10-11 02:50:56,493 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:56" (1/1) ... [2024-10-11 02:50:56,512 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:56,513 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:56" (1/1) ... [2024-10-11 02:50:56,513 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:56" (1/1) ... [2024-10-11 02:50:56,524 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:56" (1/1) ... [2024-10-11 02:50:56,531 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:56" (1/1) ... [2024-10-11 02:50:56,535 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:56" (1/1) ... [2024-10-11 02:50:56,538 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:56" (1/1) ... [2024-10-11 02:50:56,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:50:56,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:50:56,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:50:56,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:50:56,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:56" (1/1) ... [2024-10-11 02:50:56,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:50:56,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:56,580 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:56,586 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:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-11 02:50:56,620 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-11 02:50:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-11 02:50:56,620 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-11 02:50:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-11 02:50:56,620 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-11 02:50:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-11 02:50:56,621 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-11 02:50:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-11 02:50:56,621 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-11 02:50:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:50:56,621 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:50:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2024-10-11 02:50:56,621 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2024-10-11 02:50:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:50:56,622 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:50:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:50:56,622 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:50:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-11 02:50:56,623 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-11 02:50:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:50:56,623 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:50:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:50:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:50:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:50:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:50:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:50:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-11 02:50:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-11 02:50:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-11 02:50:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-11 02:50:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:50:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:50:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:50:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:50:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:50:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:50:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:50:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:50:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-11 02:50:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-11 02:50:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:50:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:50:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-11 02:50:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-11 02:50:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:50:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:50:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:50:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:50:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:50:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:50:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-11 02:50:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-11 02:50:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:50:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:50:56,809 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:50:56,812 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:50:57,659 INFO L? ?]: Removed 478 outVars from TransFormulas that were not future-live. [2024-10-11 02:50:57,660 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:50:57,720 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:50:57,720 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:50:57,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:50:57 BoogieIcfgContainer [2024-10-11 02:50:57,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:50:57,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:50:57,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:50:57,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:50:57,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:50:55" (1/3) ... [2024-10-11 02:50:57,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6099c36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:50:57, skipping insertion in model container [2024-10-11 02:50:57,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:56" (2/3) ... [2024-10-11 02:50:57,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6099c36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:50:57, skipping insertion in model container [2024-10-11 02:50:57,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:50:57" (3/3) ... [2024-10-11 02:50:57,728 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec6_product20.cil.c [2024-10-11 02:50:57,743 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:50:57,743 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:50:57,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:50:57,835 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;@cdb46a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:50:57,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:50:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 267 states have (on average 1.6217228464419475) internal successors, (433), 272 states have internal predecessors, (433), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 02:50:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 02:50:57,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:57,867 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, 1, 1, 1, 1, 1] [2024-10-11 02:50:57,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:57,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1340731310, now seen corresponding path program 1 times [2024-10-11 02:50:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:57,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723125053] [2024-10-11 02:50:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:50:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:50:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:50:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:50:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:50:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:50:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:50:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:50:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:50:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:50:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:50:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:50:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:50:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,539 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:58,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:58,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723125053] [2024-10-11 02:50:58,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723125053] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:58,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831109745] [2024-10-11 02:50:58,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:58,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:58,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:58,544 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:58,546 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:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:58,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:50:58,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:58,874 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:58,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:58,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831109745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:58,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:58,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-11 02:50:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240109054] [2024-10-11 02:50:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:58,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:50:58,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:50:58,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:50:58,922 INFO L87 Difference]: Start difference. First operand has 351 states, 267 states have (on average 1.6217228464419475) internal successors, (433), 272 states have internal predecessors, (433), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:50:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:59,010 INFO L93 Difference]: Finished difference Result 518 states and 797 transitions. [2024-10-11 02:50:59,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:50:59,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116 [2024-10-11 02:50:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:59,026 INFO L225 Difference]: With dead ends: 518 [2024-10-11 02:50:59,027 INFO L226 Difference]: Without dead ends: 348 [2024-10-11 02:50:59,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:50:59,034 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:59,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:50:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-11 02:50:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-10-11 02:50:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 265 states have (on average 1.6075471698113208) internal successors, (426), 269 states have internal predecessors, (426), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-11 02:50:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 541 transitions. [2024-10-11 02:50:59,092 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 541 transitions. Word has length 116 [2024-10-11 02:50:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:59,098 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 541 transitions. [2024-10-11 02:50:59,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:50:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 541 transitions. [2024-10-11 02:50:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 02:50:59,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:59,102 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, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:59,117 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:59,306 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:59,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:59,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash -769185497, now seen corresponding path program 1 times [2024-10-11 02:50:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:59,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649727397] [2024-10-11 02:50:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:50:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:50:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:50:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:50:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:50:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:50:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:50:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:50:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:50:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:50:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:50:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:50:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:50:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,608 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:59,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:59,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649727397] [2024-10-11 02:50:59,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649727397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:59,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768802936] [2024-10-11 02:50:59,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:59,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:59,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:59,612 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:59,614 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:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:59,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:50:59,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:59,886 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:59,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:59,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768802936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:59,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:59,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:50:59,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143703845] [2024-10-11 02:50:59,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:59,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:50:59,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:50:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:50:59,892 INFO L87 Difference]: Start difference. First operand 348 states and 541 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:50:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:59,949 INFO L93 Difference]: Finished difference Result 514 states and 781 transitions. [2024-10-11 02:50:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:50:59,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2024-10-11 02:50:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:59,953 INFO L225 Difference]: With dead ends: 514 [2024-10-11 02:50:59,953 INFO L226 Difference]: Without dead ends: 350 [2024-10-11 02:50:59,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 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:59,960 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:59,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1055 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:50:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-11 02:50:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-10-11 02:50:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 267 states have (on average 1.6029962546816479) internal successors, (428), 271 states have internal predecessors, (428), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-11 02:50:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 543 transitions. [2024-10-11 02:50:59,991 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 543 transitions. Word has length 117 [2024-10-11 02:50:59,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:59,992 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 543 transitions. [2024-10-11 02:50:59,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:50:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 543 transitions. [2024-10-11 02:50:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 02:50:59,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:59,999 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:51:00,199 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:51:00,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:00,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:00,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1292295343, now seen corresponding path program 1 times [2024-10-11 02:51:00,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:00,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276979376] [2024-10-11 02:51:00,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:00,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:51:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:51:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:51:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:51:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:51:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:51:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:51:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:51:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:51:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:51:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:51:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:51:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:51:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:51:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 02:51:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 02:51:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 02:51:00,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:00,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276979376] [2024-10-11 02:51:00,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276979376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:51:00,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888789210] [2024-10-11 02:51:00,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:00,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:51:00,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:51:00,467 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:51:00,468 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:51:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:00,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:51:00,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:51:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 02:51:00,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:51:00,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888789210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:00,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:51:00,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:51:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652390640] [2024-10-11 02:51:00,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:00,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:51:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:51:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:51:00,762 INFO L87 Difference]: Start difference. First operand 350 states and 543 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:00,814 INFO L93 Difference]: Finished difference Result 748 states and 1178 transitions. [2024-10-11 02:51:00,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:51:00,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 142 [2024-10-11 02:51:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:00,818 INFO L225 Difference]: With dead ends: 748 [2024-10-11 02:51:00,818 INFO L226 Difference]: Without dead ends: 420 [2024-10-11 02:51:00,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 175 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:51:00,822 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 129 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:00,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1013 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:51:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-11 02:51:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 415. [2024-10-11 02:51:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 318 states have (on average 1.619496855345912) internal successors, (515), 322 states have internal predecessors, (515), 72 states have call successors, (72), 24 states have call predecessors, (72), 24 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-11 02:51:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 658 transitions. [2024-10-11 02:51:00,848 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 658 transitions. Word has length 142 [2024-10-11 02:51:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:00,848 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 658 transitions. [2024-10-11 02:51:00,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 658 transitions. [2024-10-11 02:51:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 02:51:00,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:00,853 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,868 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:51:01,053 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:51:01,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:01,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2142515506, now seen corresponding path program 1 times [2024-10-11 02:51:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:01,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591532831] [2024-10-11 02:51:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:51:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:51:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:51:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:51:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:51:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:51:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:51:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:51:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:51:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:51:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:51:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:51:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:51:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:51:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 02:51:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 02:51:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 02:51:01,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591532831] [2024-10-11 02:51:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591532831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:51:01,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780503813] [2024-10-11 02:51:01,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:01,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:51:01,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:51:01,314 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:51:01,316 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:51:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:01,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:51:01,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:51:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 02:51:01,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:51:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780503813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:01,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:51:01,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 02:51:01,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662326182] [2024-10-11 02:51:01,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:01,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:51:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:01,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:51:01,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:51:01,634 INFO L87 Difference]: Start difference. First operand 415 states and 658 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 02:51:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:01,748 INFO L93 Difference]: Finished difference Result 825 states and 1310 transitions. [2024-10-11 02:51:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:51:01,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 143 [2024-10-11 02:51:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:01,753 INFO L225 Difference]: With dead ends: 825 [2024-10-11 02:51:01,754 INFO L226 Difference]: Without dead ends: 417 [2024-10-11 02:51:01,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 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:51:01,757 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 2 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:01,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2069 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:51:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-11 02:51:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2024-10-11 02:51:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 319 states have (on average 1.6175548589341693) internal successors, (516), 324 states have internal predecessors, (516), 72 states have call successors, (72), 24 states have call predecessors, (72), 25 states have return successors, (73), 70 states have call predecessors, (73), 71 states have call successors, (73) [2024-10-11 02:51:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 661 transitions. [2024-10-11 02:51:01,783 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 661 transitions. Word has length 143 [2024-10-11 02:51:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:01,784 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 661 transitions. [2024-10-11 02:51:01,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 02:51:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 661 transitions. [2024-10-11 02:51:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 02:51:01,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:01,787 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, 1, 1, 1, 1, 1, 1] [2024-10-11 02:51:01,805 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:51:01,988 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:51:01,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:01,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1534895324, now seen corresponding path program 1 times [2024-10-11 02:51:01,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:01,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418972336] [2024-10-11 02:51:01,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:01,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:51:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:51:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:51:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:51:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:51:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:51:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:51:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:51:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:51:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:51:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:51:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:51:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,209 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:51:02,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:02,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418972336] [2024-10-11 02:51:02,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418972336] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:51:02,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270732421] [2024-10-11 02:51:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:02,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:51:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:51:02,212 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:51:02,214 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:51:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:51:02,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:51:02,547 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:51:02,548 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:51:02,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270732421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:02,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:51:02,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:51:02,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209416779] [2024-10-11 02:51:02,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:02,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:51:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:02,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:51:02,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:51:02,551 INFO L87 Difference]: Start difference. First operand 417 states and 661 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 02:51:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:02,640 INFO L93 Difference]: Finished difference Result 827 states and 1315 transitions. [2024-10-11 02:51:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:51:02,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 126 [2024-10-11 02:51:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:02,644 INFO L225 Difference]: With dead ends: 827 [2024-10-11 02:51:02,644 INFO L226 Difference]: Without dead ends: 419 [2024-10-11 02:51:02,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 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:51:02,646 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 2 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:02,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2055 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:51:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-11 02:51:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2024-10-11 02:51:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 320 states have (on average 1.615625) internal successors, (517), 326 states have internal predecessors, (517), 72 states have call successors, (72), 24 states have call predecessors, (72), 26 states have return successors, (78), 70 states have call predecessors, (78), 71 states have call successors, (78) [2024-10-11 02:51:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 667 transitions. [2024-10-11 02:51:02,661 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 667 transitions. Word has length 126 [2024-10-11 02:51:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:02,661 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 667 transitions. [2024-10-11 02:51:02,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 02:51:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 667 transitions. [2024-10-11 02:51:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 02:51:02,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:02,664 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,683 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:51:02,868 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:51:02,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:02,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash 214802599, now seen corresponding path program 1 times [2024-10-11 02:51:02,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61785373] [2024-10-11 02:51:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:51:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:51:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:51:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:51:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:51:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:51:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:51:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:51:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:51:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:51:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:51:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:51:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:51:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 02:51:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 02:51:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61785373] [2024-10-11 02:51:03,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61785373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:03,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:03,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:51:03,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621805753] [2024-10-11 02:51:03,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:03,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:51:03,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:03,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:51:03,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:51:03,092 INFO L87 Difference]: Start difference. First operand 419 states and 667 transitions. Second operand has 9 states, 8 states have (on average 10.5) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (22), 6 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 02:51:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:04,856 INFO L93 Difference]: Finished difference Result 908 states and 1476 transitions. [2024-10-11 02:51:04,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:51:04,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (22), 6 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 145 [2024-10-11 02:51:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:04,861 INFO L225 Difference]: With dead ends: 908 [2024-10-11 02:51:04,862 INFO L226 Difference]: Without dead ends: 508 [2024-10-11 02:51:04,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 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:51:04,864 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1145 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:04,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1197 Invalid, 2668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:51:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-11 02:51:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 419. [2024-10-11 02:51:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 320 states have (on average 1.615625) internal successors, (517), 326 states have internal predecessors, (517), 72 states have call successors, (72), 24 states have call predecessors, (72), 26 states have return successors, (77), 70 states have call predecessors, (77), 71 states have call successors, (77) [2024-10-11 02:51:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 666 transitions. [2024-10-11 02:51:04,922 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 666 transitions. Word has length 145 [2024-10-11 02:51:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:04,923 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 666 transitions. [2024-10-11 02:51:04,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (22), 6 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 02:51:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 666 transitions. [2024-10-11 02:51:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 02:51:04,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:04,925 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, 1, 1, 1, 1] [2024-10-11 02:51:04,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:51:04,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:04,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:04,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1845631031, now seen corresponding path program 1 times [2024-10-11 02:51:04,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:04,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339837334] [2024-10-11 02:51:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:04,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:51:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:51:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:51:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:51:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:51:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:51:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:51:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:51:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:51:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:51:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:51:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:51:05,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:05,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339837334] [2024-10-11 02:51:05,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339837334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:05,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:05,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:51:05,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939568222] [2024-10-11 02:51:05,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:05,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:51:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:05,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:51:05,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:51:05,093 INFO L87 Difference]: Start difference. First operand 419 states and 666 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 02:51:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:06,778 INFO L93 Difference]: Finished difference Result 910 states and 1479 transitions. [2024-10-11 02:51:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:51:06,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2024-10-11 02:51:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:06,782 INFO L225 Difference]: With dead ends: 910 [2024-10-11 02:51:06,782 INFO L226 Difference]: Without dead ends: 510 [2024-10-11 02:51:06,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:51:06,784 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1137 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:06,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1199 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:51:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-11 02:51:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 421. [2024-10-11 02:51:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 321 states have (on average 1.6137071651090342) internal successors, (518), 328 states have internal predecessors, (518), 72 states have call successors, (72), 24 states have call predecessors, (72), 27 states have return successors, (79), 70 states have call predecessors, (79), 71 states have call successors, (79) [2024-10-11 02:51:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 669 transitions. [2024-10-11 02:51:06,816 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 669 transitions. Word has length 128 [2024-10-11 02:51:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:06,817 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 669 transitions. [2024-10-11 02:51:06,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 02:51:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 669 transitions. [2024-10-11 02:51:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 02:51:06,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:06,819 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:51:06,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:06,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2056504571, now seen corresponding path program 1 times [2024-10-11 02:51:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709779249] [2024-10-11 02:51:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:06,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:06,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:06,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:06,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:51:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:51:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:51:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:51:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:51:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:51:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:51:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:51:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:51:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:51:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:51:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709779249] [2024-10-11 02:51:07,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709779249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:07,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:07,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:51:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21429111] [2024-10-11 02:51:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:07,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:51:07,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:07,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:51:07,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:51:07,042 INFO L87 Difference]: Start difference. First operand 421 states and 669 transitions. Second operand has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (19), 6 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 02:51:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:09,228 INFO L93 Difference]: Finished difference Result 908 states and 1474 transitions. [2024-10-11 02:51:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:51:09,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (19), 6 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2024-10-11 02:51:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:09,233 INFO L225 Difference]: With dead ends: 908 [2024-10-11 02:51:09,233 INFO L226 Difference]: Without dead ends: 510 [2024-10-11 02:51:09,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 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:51:09,235 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1143 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 3870 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 4269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 3870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:09,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 1664 Invalid, 4269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 3870 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:51:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-11 02:51:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 421. [2024-10-11 02:51:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 321 states have (on average 1.6137071651090342) internal successors, (518), 328 states have internal predecessors, (518), 72 states have call successors, (72), 24 states have call predecessors, (72), 27 states have return successors, (78), 70 states have call predecessors, (78), 71 states have call successors, (78) [2024-10-11 02:51:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 668 transitions. [2024-10-11 02:51:09,262 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 668 transitions. Word has length 129 [2024-10-11 02:51:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:09,262 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 668 transitions. [2024-10-11 02:51:09,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (19), 6 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 02:51:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 668 transitions. [2024-10-11 02:51:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 02:51:09,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:09,265 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:51:09,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:51:09,266 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:09,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:09,266 INFO L85 PathProgramCache]: Analyzing trace with hash -792057900, now seen corresponding path program 1 times [2024-10-11 02:51:09,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:09,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035390389] [2024-10-11 02:51:09,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:51:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:51:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:51:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:51:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:51:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:51:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:51:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:51:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:51:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:51:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 02:51:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 02:51:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 02:51:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:51:09,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035390389] [2024-10-11 02:51:09,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035390389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:09,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:09,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:51:09,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457864709] [2024-10-11 02:51:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:09,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:51:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:09,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:51:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:51:09,489 INFO L87 Difference]: Start difference. First operand 421 states and 668 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-11 02:51:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:11,581 INFO L93 Difference]: Finished difference Result 910 states and 1480 transitions. [2024-10-11 02:51:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:51:11,582 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2024-10-11 02:51:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:11,585 INFO L225 Difference]: With dead ends: 910 [2024-10-11 02:51:11,585 INFO L226 Difference]: Without dead ends: 512 [2024-10-11 02:51:11,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 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:51:11,587 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1140 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 3876 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 4283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 3876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:11,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 1665 Invalid, 4283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 3876 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 02:51:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-11 02:51:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 423. [2024-10-11 02:51:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 322 states have (on average 1.6118012422360248) internal successors, (519), 330 states have internal predecessors, (519), 72 states have call successors, (72), 24 states have call predecessors, (72), 28 states have return successors, (83), 70 states have call predecessors, (83), 71 states have call successors, (83) [2024-10-11 02:51:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 674 transitions. [2024-10-11 02:51:11,648 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 674 transitions. Word has length 148 [2024-10-11 02:51:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:11,648 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 674 transitions. [2024-10-11 02:51:11,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-11 02:51:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 674 transitions. [2024-10-11 02:51:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 02:51:11,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:11,651 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:51:11,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:11,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1121591057, now seen corresponding path program 1 times [2024-10-11 02:51:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024637713] [2024-10-11 02:51:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:51:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:51:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:51:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:51:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:51:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:51:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:51:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:51:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:51:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:51:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 02:51:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 02:51:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 02:51:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 02:51:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024637713] [2024-10-11 02:51:11,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024637713] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:51:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708745141] [2024-10-11 02:51:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:11,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:51:11,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:51:11,882 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:51:11,884 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:51:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:12,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:51:12,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:51:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:51:12,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:51:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:51:12,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708745141] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:51:12,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:51:12,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-11 02:51:12,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349492615] [2024-10-11 02:51:12,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:51:12,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 02:51:12,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:12,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 02:51:12,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:51:12,255 INFO L87 Difference]: Start difference. First operand 423 states and 674 transitions. Second operand has 15 states, 14 states have (on average 10.571428571428571) internal successors, (148), 11 states have internal predecessors, (148), 4 states have call successors, (45), 6 states have call predecessors, (45), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2024-10-11 02:51:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:14,692 INFO L93 Difference]: Finished difference Result 1329 states and 2256 transitions. [2024-10-11 02:51:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 02:51:14,693 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.571428571428571) internal successors, (148), 11 states have internal predecessors, (148), 4 states have call successors, (45), 6 states have call predecessors, (45), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) Word has length 149 [2024-10-11 02:51:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:14,698 INFO L225 Difference]: With dead ends: 1329 [2024-10-11 02:51:14,699 INFO L226 Difference]: Without dead ends: 932 [2024-10-11 02:51:14,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 331 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:51:14,701 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 2331 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 4766 mSolverCounterSat, 801 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2352 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 5567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 801 IncrementalHoareTripleChecker+Valid, 4766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:14,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2352 Valid, 2008 Invalid, 5567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [801 Valid, 4766 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 02:51:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-11 02:51:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 828. [2024-10-11 02:51:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 648 states have (on average 1.654320987654321) internal successors, (1072), 656 states have internal predecessors, (1072), 151 states have call successors, (151), 24 states have call predecessors, (151), 28 states have return successors, (172), 149 states have call predecessors, (172), 150 states have call successors, (172) [2024-10-11 02:51:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1395 transitions. [2024-10-11 02:51:14,762 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1395 transitions. Word has length 149 [2024-10-11 02:51:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:14,763 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1395 transitions. [2024-10-11 02:51:14,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.571428571428571) internal successors, (148), 11 states have internal predecessors, (148), 4 states have call successors, (45), 6 states have call predecessors, (45), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2024-10-11 02:51:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1395 transitions. [2024-10-11 02:51:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 02:51:14,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:14,768 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 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:14,783 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:51:14,968 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:51:14,969 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:14,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash -420012056, now seen corresponding path program 1 times [2024-10-11 02:51:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:14,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352132068] [2024-10-11 02:51:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:14,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:51:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:51:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:51:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:51:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:51:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:51:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:51:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:51:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:51:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:51:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 02:51:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 02:51:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 02:51:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:51:15,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:15,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352132068] [2024-10-11 02:51:15,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352132068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:15,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:15,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:51:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012690512] [2024-10-11 02:51:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:15,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:51:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:15,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:51:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:51:15,075 INFO L87 Difference]: Start difference. First operand 828 states and 1395 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, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:16,092 INFO L93 Difference]: Finished difference Result 2064 states and 3575 transitions. [2024-10-11 02:51:16,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:51:16,093 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, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-10-11 02:51:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:16,099 INFO L225 Difference]: With dead ends: 2064 [2024-10-11 02:51:16,099 INFO L226 Difference]: Without dead ends: 1304 [2024-10-11 02:51:16,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 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:51:16,102 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1267 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:16,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 915 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:51:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2024-10-11 02:51:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1210. [2024-10-11 02:51:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 951 states have (on average 1.665615141955836) internal successors, (1584), 959 states have internal predecessors, (1584), 230 states have call successors, (230), 24 states have call predecessors, (230), 28 states have return successors, (261), 228 states have call predecessors, (261), 229 states have call successors, (261) [2024-10-11 02:51:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 2075 transitions. [2024-10-11 02:51:16,156 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 2075 transitions. Word has length 153 [2024-10-11 02:51:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:16,157 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 2075 transitions. [2024-10-11 02:51:16,157 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, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 2075 transitions. [2024-10-11 02:51:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 02:51:16,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:16,164 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 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:16,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:51:16,164 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:16,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:16,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1762699114, now seen corresponding path program 1 times [2024-10-11 02:51:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:16,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942829201] [2024-10-11 02:51:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:16,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:51:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:51:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:51:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:51:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:51:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:51:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:51:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:51:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:51:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 02:51:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 02:51:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 02:51:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 02:51:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:51:16,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:16,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942829201] [2024-10-11 02:51:16,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942829201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:16,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:16,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:51:16,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381385490] [2024-10-11 02:51:16,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:16,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:51:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:16,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:51:16,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:51:16,289 INFO L87 Difference]: Start difference. First operand 1210 states and 2075 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:17,388 INFO L93 Difference]: Finished difference Result 3015 states and 5261 transitions. [2024-10-11 02:51:17,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:51:17,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2024-10-11 02:51:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:17,400 INFO L225 Difference]: With dead ends: 3015 [2024-10-11 02:51:17,400 INFO L226 Difference]: Without dead ends: 1923 [2024-10-11 02:51:17,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 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:51:17,405 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1266 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:17,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 882 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:51:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2024-10-11 02:51:17,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1829. [2024-10-11 02:51:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1451 states have (on average 1.6705720192970366) internal successors, (2424), 1459 states have internal predecessors, (2424), 349 states have call successors, (349), 24 states have call predecessors, (349), 28 states have return successors, (380), 347 states have call predecessors, (380), 348 states have call successors, (380) [2024-10-11 02:51:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 3153 transitions. [2024-10-11 02:51:17,517 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 3153 transitions. Word has length 154 [2024-10-11 02:51:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:17,517 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 3153 transitions. [2024-10-11 02:51:17,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 3153 transitions. [2024-10-11 02:51:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 02:51:17,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:17,531 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] [2024-10-11 02:51:17,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:51:17,531 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:17,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash -780696603, now seen corresponding path program 1 times [2024-10-11 02:51:17,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:17,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127149716] [2024-10-11 02:51:17,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:17,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:51:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:51:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:51:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:51:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:51:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:51:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:51:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:51:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:51:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 02:51:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:17,656 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:51:17,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127149716] [2024-10-11 02:51:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127149716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:17,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:17,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:51:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372179534] [2024-10-11 02:51:17,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:17,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:51:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:17,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:51:17,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:51:17,658 INFO L87 Difference]: Start difference. First operand 1829 states and 3153 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:51:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:18,709 INFO L93 Difference]: Finished difference Result 4455 states and 7832 transitions. [2024-10-11 02:51:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:51:18,710 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2024-10-11 02:51:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:18,723 INFO L225 Difference]: With dead ends: 4455 [2024-10-11 02:51:18,724 INFO L226 Difference]: Without dead ends: 2872 [2024-10-11 02:51:18,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 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:51:18,729 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1262 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:18,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 872 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:51:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2024-10-11 02:51:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2778. [2024-10-11 02:51:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2778 states, 2238 states have (on average 1.6751563896336015) internal successors, (3749), 2246 states have internal predecessors, (3749), 511 states have call successors, (511), 24 states have call predecessors, (511), 28 states have return successors, (558), 509 states have call predecessors, (558), 510 states have call successors, (558) [2024-10-11 02:51:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 4818 transitions. [2024-10-11 02:51:18,821 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 4818 transitions. Word has length 137 [2024-10-11 02:51:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:18,821 INFO L471 AbstractCegarLoop]: Abstraction has 2778 states and 4818 transitions. [2024-10-11 02:51:18,821 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:51:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 4818 transitions. [2024-10-11 02:51:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 02:51:18,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:18,832 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 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:18,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:51:18,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:18,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1763050933, now seen corresponding path program 1 times [2024-10-11 02:51:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126955435] [2024-10-11 02:51:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:51:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:51:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:51:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:51:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:51:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:51:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:51:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:51:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:51:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 02:51:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 02:51:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 02:51:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 02:51:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:51:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126955435] [2024-10-11 02:51:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126955435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:18,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:51:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119861833] [2024-10-11 02:51:18,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:18,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:51:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:51:18,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:51:18,940 INFO L87 Difference]: Start difference. First operand 2778 states and 4818 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, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:20,069 INFO L93 Difference]: Finished difference Result 6727 states and 11900 transitions. [2024-10-11 02:51:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:51:20,069 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, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2024-10-11 02:51:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:20,091 INFO L225 Difference]: With dead ends: 6727 [2024-10-11 02:51:20,091 INFO L226 Difference]: Without dead ends: 4404 [2024-10-11 02:51:20,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 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:51:20,101 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1257 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:20,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 875 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:51:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4404 states. [2024-10-11 02:51:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4404 to 4310. [2024-10-11 02:51:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 3525 states have (on average 1.678581560283688) internal successors, (5917), 3533 states have internal predecessors, (5917), 756 states have call successors, (756), 24 states have call predecessors, (756), 28 states have return successors, (829), 754 states have call predecessors, (829), 755 states have call successors, (829) [2024-10-11 02:51:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 7502 transitions. [2024-10-11 02:51:20,279 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 7502 transitions. Word has length 156 [2024-10-11 02:51:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:20,280 INFO L471 AbstractCegarLoop]: Abstraction has 4310 states and 7502 transitions. [2024-10-11 02:51:20,280 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, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 7502 transitions. [2024-10-11 02:51:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 02:51:20,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:20,295 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, 1] [2024-10-11 02:51:20,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:51:20,296 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:20,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:20,296 INFO L85 PathProgramCache]: Analyzing trace with hash 264470177, now seen corresponding path program 1 times [2024-10-11 02:51:20,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:20,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380669848] [2024-10-11 02:51:20,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:20,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:51:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:51:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:51:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:51:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:51:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:51:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:51:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:51:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:51:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:51:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:20,389 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:51:20,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380669848] [2024-10-11 02:51:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380669848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:20,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:20,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:51:20,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284147339] [2024-10-11 02:51:20,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:20,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:51:20,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:20,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:51:20,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:51:20,391 INFO L87 Difference]: Start difference. First operand 4310 states and 7502 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:51:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:21,728 INFO L93 Difference]: Finished difference Result 10780 states and 19111 transitions. [2024-10-11 02:51:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:51:21,728 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-10-11 02:51:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:21,763 INFO L225 Difference]: With dead ends: 10780 [2024-10-11 02:51:21,764 INFO L226 Difference]: Without dead ends: 7164 [2024-10-11 02:51:21,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 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:51:21,778 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1257 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:21,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 923 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:51:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7164 states. [2024-10-11 02:51:22,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7164 to 7070. [2024-10-11 02:51:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7070 states, 5792 states have (on average 1.6735151933701657) internal successors, (9693), 5800 states have internal predecessors, (9693), 1249 states have call successors, (1249), 24 states have call predecessors, (1249), 28 states have return successors, (1366), 1247 states have call predecessors, (1366), 1248 states have call successors, (1366) [2024-10-11 02:51:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7070 states to 7070 states and 12308 transitions. [2024-10-11 02:51:22,078 INFO L78 Accepts]: Start accepts. Automaton has 7070 states and 12308 transitions. Word has length 139 [2024-10-11 02:51:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:22,078 INFO L471 AbstractCegarLoop]: Abstraction has 7070 states and 12308 transitions. [2024-10-11 02:51:22,082 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:51:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 7070 states and 12308 transitions. [2024-10-11 02:51:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 02:51:22,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:22,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:51:22,162 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:22,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:22,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1851234959, now seen corresponding path program 1 times [2024-10-11 02:51:22,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:22,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197537485] [2024-10-11 02:51:22,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:22,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:51:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:51:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:51:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:51:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:51:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:51:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:51:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:51:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:51:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:51:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 02:51:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 02:51:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 02:51:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:51:22,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197537485] [2024-10-11 02:51:22,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197537485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:22,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:22,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:51:22,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049860181] [2024-10-11 02:51:22,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:22,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:51:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:22,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:51:22,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:51:22,262 INFO L87 Difference]: Start difference. First operand 7070 states and 12308 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:23,478 INFO L93 Difference]: Finished difference Result 17983 states and 31858 transitions. [2024-10-11 02:51:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:51:23,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2024-10-11 02:51:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:23,523 INFO L225 Difference]: With dead ends: 17983 [2024-10-11 02:51:23,523 INFO L226 Difference]: Without dead ends: 11993 [2024-10-11 02:51:23,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 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:51:23,540 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1255 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:23,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 873 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:51:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11993 states. [2024-10-11 02:51:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11993 to 11899. [2024-10-11 02:51:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11899 states, 9799 states have (on average 1.673027859985713) internal successors, (16394), 9807 states have internal predecessors, (16394), 2071 states have call successors, (2071), 24 states have call predecessors, (2071), 28 states have return successors, (2266), 2069 states have call predecessors, (2266), 2070 states have call successors, (2266) [2024-10-11 02:51:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11899 states to 11899 states and 20731 transitions. [2024-10-11 02:51:24,022 INFO L78 Accepts]: Start accepts. Automaton has 11899 states and 20731 transitions. Word has length 158 [2024-10-11 02:51:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:24,023 INFO L471 AbstractCegarLoop]: Abstraction has 11899 states and 20731 transitions. [2024-10-11 02:51:24,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 11899 states and 20731 transitions. [2024-10-11 02:51:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 02:51:24,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:24,056 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:51:24,056 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1251515828, now seen corresponding path program 1 times [2024-10-11 02:51:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:24,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223409392] [2024-10-11 02:51:24,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:51:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:51:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:51:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:51:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:51:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:51:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:51:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:51:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:51:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 02:51:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 02:51:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 02:51:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 02:51:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:51:24,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223409392] [2024-10-11 02:51:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223409392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:24,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:24,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:51:24,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416027890] [2024-10-11 02:51:24,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:24,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:51:24,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:24,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:51:24,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:51:24,158 INFO L87 Difference]: Start difference. First operand 11899 states and 20731 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:25,604 INFO L93 Difference]: Finished difference Result 28529 states and 50306 transitions. [2024-10-11 02:51:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:51:25,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 159 [2024-10-11 02:51:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:25,680 INFO L225 Difference]: With dead ends: 28529 [2024-10-11 02:51:25,680 INFO L226 Difference]: Without dead ends: 18665 [2024-10-11 02:51:25,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 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:51:25,718 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1251 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:25,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 854 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:51:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18665 states. [2024-10-11 02:51:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18665 to 18571. [2024-10-11 02:51:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18571 states, 15268 states have (on average 1.649397432538643) internal successors, (25183), 15276 states have internal predecessors, (25183), 3274 states have call successors, (3274), 24 states have call predecessors, (3274), 28 states have return successors, (3613), 3272 states have call predecessors, (3613), 3273 states have call successors, (3613) [2024-10-11 02:51:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18571 states to 18571 states and 32070 transitions. [2024-10-11 02:51:26,430 INFO L78 Accepts]: Start accepts. Automaton has 18571 states and 32070 transitions. Word has length 159 [2024-10-11 02:51:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:26,430 INFO L471 AbstractCegarLoop]: Abstraction has 18571 states and 32070 transitions. [2024-10-11 02:51:26,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 02:51:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 18571 states and 32070 transitions. [2024-10-11 02:51:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 02:51:26,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:26,461 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, 1, 1, 1, 1] [2024-10-11 02:51:26,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:51:26,462 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:26,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1991637633, now seen corresponding path program 1 times [2024-10-11 02:51:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:26,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754026366] [2024-10-11 02:51:26,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:26,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:51:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:51:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:51:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:51:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:51:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:51:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:51:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:51:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 02:51:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 02:51:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:26,549 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:51:26,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:26,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754026366] [2024-10-11 02:51:26,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754026366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:26,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:26,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:51:26,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276595799] [2024-10-11 02:51:26,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:26,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:51:26,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:26,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:51:26,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:51:26,552 INFO L87 Difference]: Start difference. First operand 18571 states and 32070 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:51:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:28,414 INFO L93 Difference]: Finished difference Result 49162 states and 86425 transitions. [2024-10-11 02:51:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:51:28,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2024-10-11 02:51:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:28,541 INFO L225 Difference]: With dead ends: 49162 [2024-10-11 02:51:28,542 INFO L226 Difference]: Without dead ends: 33246 [2024-10-11 02:51:28,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 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:51:28,587 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1253 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:28,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 872 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:51:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33246 states. [2024-10-11 02:51:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33246 to 33152. [2024-10-11 02:51:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33152 states, 27399 states have (on average 1.6463739552538414) internal successors, (45109), 27407 states have internal predecessors, (45109), 5724 states have call successors, (5724), 24 states have call predecessors, (5724), 28 states have return successors, (6337), 5722 states have call predecessors, (6337), 5723 states have call successors, (6337) [2024-10-11 02:51:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33152 states to 33152 states and 57170 transitions. [2024-10-11 02:51:30,163 INFO L78 Accepts]: Start accepts. Automaton has 33152 states and 57170 transitions. Word has length 142 [2024-10-11 02:51:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:30,164 INFO L471 AbstractCegarLoop]: Abstraction has 33152 states and 57170 transitions. [2024-10-11 02:51:30,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:51:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 33152 states and 57170 transitions. [2024-10-11 02:51:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 02:51:30,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:30,204 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, 1, 1, 1, 1, 1] [2024-10-11 02:51:30,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:51:30,205 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:30,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1247278915, now seen corresponding path program 1 times [2024-10-11 02:51:30,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:30,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413262491] [2024-10-11 02:51:30,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:30,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:51:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:51:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:51:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:51:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:51:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:51:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:51:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:51:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 02:51:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 02:51:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:30,312 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:51:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:30,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413262491] [2024-10-11 02:51:30,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413262491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:30,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:30,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:51:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511578743] [2024-10-11 02:51:30,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:30,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:51:30,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:30,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:51:30,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:51:30,314 INFO L87 Difference]: Start difference. First operand 33152 states and 57170 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:51:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:32,973 INFO L93 Difference]: Finished difference Result 90464 states and 158254 transitions. [2024-10-11 02:51:32,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:51:32,973 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-10-11 02:51:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:33,227 INFO L225 Difference]: With dead ends: 90464 [2024-10-11 02:51:33,228 INFO L226 Difference]: Without dead ends: 60858 [2024-10-11 02:51:33,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 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:51:33,316 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1250 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:33,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 884 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:51:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60858 states. [2024-10-11 02:51:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60858 to 60764. [2024-10-11 02:51:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60764 states, 50498 states have (on average 1.6424214820388927) internal successors, (82939), 50506 states have internal predecessors, (82939), 10237 states have call successors, (10237), 24 states have call predecessors, (10237), 28 states have return successors, (11382), 10235 states have call predecessors, (11382), 10236 states have call successors, (11382) [2024-10-11 02:51:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60764 states to 60764 states and 104558 transitions. [2024-10-11 02:51:35,825 INFO L78 Accepts]: Start accepts. Automaton has 60764 states and 104558 transitions. Word has length 143 [2024-10-11 02:51:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:35,826 INFO L471 AbstractCegarLoop]: Abstraction has 60764 states and 104558 transitions. [2024-10-11 02:51:35,826 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:51:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 60764 states and 104558 transitions. [2024-10-11 02:51:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 02:51:35,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:35,893 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, 1, 1, 1, 1, 1, 1] [2024-10-11 02:51:35,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:51:35,893 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:35,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:35,894 INFO L85 PathProgramCache]: Analyzing trace with hash -705369185, now seen corresponding path program 1 times [2024-10-11 02:51:35,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:35,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410164004] [2024-10-11 02:51:35,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:35,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:51:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:51:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:51:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:51:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:51:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:51:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:51:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 02:51:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 02:51:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 02:51:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:35,994 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:51:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410164004] [2024-10-11 02:51:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410164004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:35,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:35,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:51:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877039593] [2024-10-11 02:51:35,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:35,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:51:35,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:35,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:51:35,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:51:35,996 INFO L87 Difference]: Start difference. First operand 60764 states and 104558 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:51:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:39,557 INFO L93 Difference]: Finished difference Result 113816 states and 199607 transitions. [2024-10-11 02:51:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:51:39,558 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2024-10-11 02:51:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:40,171 INFO L225 Difference]: With dead ends: 113816 [2024-10-11 02:51:40,171 INFO L226 Difference]: Without dead ends: 113652 [2024-10-11 02:51:40,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 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:51:40,220 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1245 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:40,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 887 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:51:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113652 states. [2024-10-11 02:51:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113652 to 113558. [2024-10-11 02:51:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113558 states, 94924 states have (on average 1.6373941258269773) internal successors, (155428), 94932 states have internal predecessors, (155428), 18605 states have call successors, (18605), 24 states have call predecessors, (18605), 28 states have return successors, (20796), 18603 states have call predecessors, (20796), 18604 states have call successors, (20796) [2024-10-11 02:51:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113558 states to 113558 states and 194829 transitions. [2024-10-11 02:51:44,232 INFO L78 Accepts]: Start accepts. Automaton has 113558 states and 194829 transitions. Word has length 144 [2024-10-11 02:51:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:44,232 INFO L471 AbstractCegarLoop]: Abstraction has 113558 states and 194829 transitions. [2024-10-11 02:51:44,232 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, (19), 6 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:51:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 113558 states and 194829 transitions. [2024-10-11 02:51:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 02:51:44,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:44,315 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:51:44,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:51:44,315 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:44,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash 802422908, now seen corresponding path program 1 times [2024-10-11 02:51:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:44,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991670737] [2024-10-11 02:51:44,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:51:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:51:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:51:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:51:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:51:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:51:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:51:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:51:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:51:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 02:51:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:51:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991670737] [2024-10-11 02:51:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991670737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:51:45,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140194452] [2024-10-11 02:51:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:45,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:51:45,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:51:45,146 INFO L229 MonitoredProcess]: Starting monitored process 8 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:51:45,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:51:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:45,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 02:51:45,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:51:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 02:51:45,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:51:45,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140194452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:45,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:51:45,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 26 [2024-10-11 02:51:45,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161786622] [2024-10-11 02:51:45,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:45,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:51:45,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:45,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:51:45,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-10-11 02:51:45,794 INFO L87 Difference]: Start difference. First operand 113558 states and 194829 transitions. Second operand has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-11 02:51:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:51,372 INFO L93 Difference]: Finished difference Result 226225 states and 393617 transitions. [2024-10-11 02:51:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 02:51:51,373 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 145 [2024-10-11 02:51:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:52,518 INFO L225 Difference]: With dead ends: 226225 [2024-10-11 02:51:52,518 INFO L226 Difference]: Without dead ends: 226066 [2024-10-11 02:51:52,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 02:51:52,631 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 852 mSDsluCounter, 4332 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 4947 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:52,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 4947 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:51:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226066 states. [2024-10-11 02:52:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226066 to 226038. [2024-10-11 02:52:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226038 states, 189008 states have (on average 1.6380893930415643) internal successors, (309612), 188913 states have internal predecessors, (309612), 36960 states have call successors, (36960), 63 states have call predecessors, (36960), 69 states have return successors, (44621), 37067 states have call predecessors, (44621), 36957 states have call successors, (44621) [2024-10-11 02:52:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226038 states to 226038 states and 391193 transitions. [2024-10-11 02:52:02,549 INFO L78 Accepts]: Start accepts. Automaton has 226038 states and 391193 transitions. Word has length 145 [2024-10-11 02:52:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:02,550 INFO L471 AbstractCegarLoop]: Abstraction has 226038 states and 391193 transitions. [2024-10-11 02:52:02,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-11 02:52:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 226038 states and 391193 transitions. [2024-10-11 02:52:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 02:52:02,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:02,754 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:52:02,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 02:52:02,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:52:02,955 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:02,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:02,955 INFO L85 PathProgramCache]: Analyzing trace with hash -908071589, now seen corresponding path program 1 times [2024-10-11 02:52:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:02,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153718272] [2024-10-11 02:52:02,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:52:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:52:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:52:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:52:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:52:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:52:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:52:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:52:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 02:52:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 02:52:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:03,218 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:52:03,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:03,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153718272] [2024-10-11 02:52:03,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153718272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:03,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:03,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 02:52:03,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930346282] [2024-10-11 02:52:03,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:03,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:52:03,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:03,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:52:03,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:52:03,221 INFO L87 Difference]: Start difference. First operand 226038 states and 391193 transitions. Second operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 7 states have internal predecessors, (95), 5 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16)