./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product35.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8693f57a03775f9dd58f5523ab36f07a2ce550b119e4923229e8bee683b68937 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:49:23,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:49:23,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:49:23,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:49:23,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:49:23,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:49:23,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:49:23,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:49:23,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:49:23,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:49:23,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:49:23,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:49:23,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:49:23,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:49:23,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:49:23,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:49:23,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:49:23,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:49:23,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:49:23,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:49:23,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:49:23,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:49:23,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:49:23,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:49:23,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:49:23,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:49:23,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:49:23,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:49:23,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:49:23,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:49:23,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:49:23,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:49:23,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:49:23,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:49:23,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:49:23,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:49:23,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:49:23,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:49:23,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:49:23,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:49:23,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:49:23,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:49:23,412 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8693f57a03775f9dd58f5523ab36f07a2ce550b119e4923229e8bee683b68937 [2024-11-11 20:49:23,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:49:23,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:49:23,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:49:23,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:49:23,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:49:23,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product35.cil.c [2024-11-11 20:49:24,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:49:25,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:49:25,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product35.cil.c [2024-11-11 20:49:25,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf5a4a30/290be7dd1a9249debab6d6df10f3cdde/FLAG86b466dd5 [2024-11-11 20:49:25,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf5a4a30/290be7dd1a9249debab6d6df10f3cdde [2024-11-11 20:49:25,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:49:25,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:49:25,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:49:25,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:49:25,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:49:25,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:49:25" (1/1) ... [2024-11-11 20:49:25,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686d76d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:25, skipping insertion in model container [2024-11-11 20:49:25,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:49:25" (1/1) ... [2024-11-11 20:49:25,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:49:25,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product35.cil.c[16425,16438] [2024-11-11 20:49:25,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:49:25,873 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:49:25,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2024-11-11 20:49:25,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [528] [2024-11-11 20:49:25,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [571] [2024-11-11 20:49:25,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [895] [2024-11-11 20:49:25,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [904] [2024-11-11 20:49:25,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [939] [2024-11-11 20:49:25,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1338] [2024-11-11 20:49:25,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1704] [2024-11-11 20:49:25,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2764] [2024-11-11 20:49:25,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2986] [2024-11-11 20:49:25,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [3121] [2024-11-11 20:49:25,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product35.cil.c[16425,16438] [2024-11-11 20:49:25,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:49:26,000 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:49:26,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26 WrapperNode [2024-11-11 20:49:26,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:49:26,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:49:26,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:49:26,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:49:26,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,072 INFO L138 Inliner]: procedures = 138, calls = 230, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1167 [2024-11-11 20:49:26,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:49:26,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:49:26,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:49:26,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:49:26,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,119 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-11 20:49:26,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:49:26,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:49:26,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:49:26,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:49:26,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (1/1) ... [2024-11-11 20:49:26,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:49:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:26,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:49:26,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:49:26,313 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-11 20:49:26,313 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-11 20:49:26,313 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-11-11 20:49:26,314 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-11-11 20:49:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:49:26,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:49:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-11-11 20:49:26,315 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-11-11 20:49:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:49:26,315 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:49:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:49:26,315 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:49:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2024-11-11 20:49:26,316 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2024-11-11 20:49:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:49:26,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:49:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:49:26,317 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:49:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:49:26,317 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:49:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:49:26,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:49:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:49:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:49:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:49:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:49:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:49:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:49:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-11-11 20:49:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-11-11 20:49:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:49:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:49:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:49:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:49:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:49:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-11 20:49:26,319 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-11 20:49:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-11-11 20:49:26,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-11-11 20:49:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:49:26,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:49:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:49:26,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:49:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:49:26,319 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:49:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:49:26,319 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:49:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:49:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:49:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:49:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:49:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:49:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:49:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:49:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:49:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:49:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:49:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:49:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:49:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:49:26,321 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:49:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-11-11 20:49:26,322 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-11-11 20:49:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:49:26,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:49:26,476 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:49:26,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:49:27,318 INFO L? ?]: Removed 610 outVars from TransFormulas that were not future-live. [2024-11-11 20:49:27,319 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:49:27,344 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:49:27,344 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:49:27,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:49:27 BoogieIcfgContainer [2024-11-11 20:49:27,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:49:27,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:49:27,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:49:27,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:49:27,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:49:25" (1/3) ... [2024-11-11 20:49:27,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4455e58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:49:27, skipping insertion in model container [2024-11-11 20:49:27,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:26" (2/3) ... [2024-11-11 20:49:27,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4455e58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:49:27, skipping insertion in model container [2024-11-11 20:49:27,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:49:27" (3/3) ... [2024-11-11 20:49:27,353 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec8_product35.cil.c [2024-11-11 20:49:27,365 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:49:27,365 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:49:27,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:49:27,425 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;@41523809, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:49:27,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:49:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 467 states, 361 states have (on average 1.5346260387811634) internal successors, (554), 366 states have internal predecessors, (554), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-11 20:49:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:49:27,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:27,454 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:27,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:27,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1305642597, now seen corresponding path program 1 times [2024-11-11 20:49:27,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:27,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479194324] [2024-11-11 20:49:27,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:27,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:27,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:49:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:49:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:49:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:49:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:49:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:49:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:49:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:49:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:49:28,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:28,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479194324] [2024-11-11 20:49:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479194324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853085475] [2024-11-11 20:49:28,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:28,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:28,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:28,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:49:28,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:49:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:49:28,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:49:28,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853085475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:28,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:28,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-11 20:49:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651813042] [2024-11-11 20:49:28,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:28,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:49:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:28,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:49:28,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:49:28,421 INFO L87 Difference]: Start difference. First operand has 467 states, 361 states have (on average 1.5346260387811634) internal successors, (554), 366 states have internal predecessors, (554), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:28,477 INFO L93 Difference]: Finished difference Result 736 states and 1090 transitions. [2024-11-11 20:49:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:49:28,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-11-11 20:49:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:28,492 INFO L225 Difference]: With dead ends: 736 [2024-11-11 20:49:28,492 INFO L226 Difference]: Without dead ends: 460 [2024-11-11 20:49:28,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:49:28,499 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:28,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-11 20:49:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2024-11-11 20:49:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 355 states have (on average 1.5295774647887324) internal successors, (543), 359 states have internal predecessors, (543), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-11 20:49:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 692 transitions. [2024-11-11 20:49:28,564 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 692 transitions. Word has length 110 [2024-11-11 20:49:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:28,565 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 692 transitions. [2024-11-11 20:49:28,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 692 transitions. [2024-11-11 20:49:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:49:28,569 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:28,569 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:28,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:49:28,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-11 20:49:28,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:28,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1412794511, now seen corresponding path program 1 times [2024-11-11 20:49:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:28,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468168717] [2024-11-11 20:49:28,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:49:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:49:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:49:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:49:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:49:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:49:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:49:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:49:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:49:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:29,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468168717] [2024-11-11 20:49:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468168717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:29,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765120239] [2024-11-11 20:49:29,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:29,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:29,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:29,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:49:29,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:49:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:49:29,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:49:29,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765120239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:29,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:49:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434001356] [2024-11-11 20:49:29,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:29,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:49:29,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:29,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:49:29,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:49:29,324 INFO L87 Difference]: Start difference. First operand 460 states and 692 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:29,367 INFO L93 Difference]: Finished difference Result 726 states and 1068 transitions. [2024-11-11 20:49:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:49:29,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-11-11 20:49:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:29,373 INFO L225 Difference]: With dead ends: 726 [2024-11-11 20:49:29,374 INFO L226 Difference]: Without dead ends: 463 [2024-11-11 20:49:29,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 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-11-11 20:49:29,376 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 1 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:29,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1378 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:29,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-11 20:49:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 462. [2024-11-11 20:49:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 357 states have (on average 1.526610644257703) internal successors, (545), 361 states have internal predecessors, (545), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-11 20:49:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 694 transitions. [2024-11-11 20:49:29,400 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 694 transitions. Word has length 111 [2024-11-11 20:49:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:29,400 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 694 transitions. [2024-11-11 20:49:29,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 694 transitions. [2024-11-11 20:49:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:49:29,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:29,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:29,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:49:29,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-11 20:49:29,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:29,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:29,607 INFO L85 PathProgramCache]: Analyzing trace with hash 389162940, now seen corresponding path program 1 times [2024-11-11 20:49:29,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:29,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343637225] [2024-11-11 20:49:29,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:29,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:49:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:49:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:49:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:49:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:49:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:49:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:49:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:49:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:49:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343637225] [2024-11-11 20:49:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343637225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41557492] [2024-11-11 20:49:29,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:29,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:29,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:29,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:49:29,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:49:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:49:30,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:49:30,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:30,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41557492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:30,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:30,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:49:30,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073242065] [2024-11-11 20:49:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:30,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:49:30,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:30,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:49:30,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:49:30,097 INFO L87 Difference]: Start difference. First operand 462 states and 694 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:30,140 INFO L93 Difference]: Finished difference Result 977 states and 1488 transitions. [2024-11-11 20:49:30,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:49:30,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-11-11 20:49:30,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:30,144 INFO L225 Difference]: With dead ends: 977 [2024-11-11 20:49:30,144 INFO L226 Difference]: Without dead ends: 542 [2024-11-11 20:49:30,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 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-11-11 20:49:30,148 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 142 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:30,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1352 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-11 20:49:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 534. [2024-11-11 20:49:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 415 states have (on average 1.546987951807229) internal successors, (642), 419 states have internal predecessors, (642), 89 states have call successors, (89), 29 states have call predecessors, (89), 29 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-11 20:49:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 819 transitions. [2024-11-11 20:49:30,177 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 819 transitions. Word has length 120 [2024-11-11 20:49:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:30,178 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 819 transitions. [2024-11-11 20:49:30,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 819 transitions. [2024-11-11 20:49:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 20:49:30,180 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:30,180 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:30,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:49:30,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:30,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:30,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2042303042, now seen corresponding path program 1 times [2024-11-11 20:49:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:30,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814403576] [2024-11-11 20:49:30,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:49:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:49:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:49:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:49:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:49:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:49:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:49:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:49:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:49:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814403576] [2024-11-11 20:49:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814403576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299638042] [2024-11-11 20:49:30,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:30,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:30,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:30,557 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:49:30,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:49:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:49:30,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:49:30,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:30,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299638042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:30,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:30,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-11 20:49:30,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644827841] [2024-11-11 20:49:30,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:30,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:49:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:30,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:49:30,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:49:30,850 INFO L87 Difference]: Start difference. First operand 534 states and 819 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:49:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:30,901 INFO L93 Difference]: Finished difference Result 1059 states and 1628 transitions. [2024-11-11 20:49:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:49:30,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-11-11 20:49:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:30,905 INFO L225 Difference]: With dead ends: 1059 [2024-11-11 20:49:30,905 INFO L226 Difference]: Without dead ends: 536 [2024-11-11 20:49:30,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 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-11-11 20:49:30,908 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 2 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:30,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2725 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-11 20:49:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2024-11-11 20:49:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 416 states have (on average 1.5456730769230769) internal successors, (643), 421 states have internal predecessors, (643), 89 states have call successors, (89), 29 states have call predecessors, (89), 30 states have return successors, (90), 87 states have call predecessors, (90), 88 states have call successors, (90) [2024-11-11 20:49:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 822 transitions. [2024-11-11 20:49:30,927 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 822 transitions. Word has length 121 [2024-11-11 20:49:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:30,927 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 822 transitions. [2024-11-11 20:49:30,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:49:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 822 transitions. [2024-11-11 20:49:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 20:49:30,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:30,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:30,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:49:31,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:31,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:31,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash -410227042, now seen corresponding path program 1 times [2024-11-11 20:49:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:31,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089848040] [2024-11-11 20:49:31,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:31,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:49:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:49:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:49:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:49:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:49:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:49:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:49:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:49:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:49:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:49:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:49:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089848040] [2024-11-11 20:49:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089848040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049947755] [2024-11-11 20:49:31,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:31,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:31,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:31,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:49:31,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:49:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:49:31,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:49:31,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049947755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:31,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:49:31,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584991691] [2024-11-11 20:49:31,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:31,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:49:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:31,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:49:31,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:49:31,618 INFO L87 Difference]: Start difference. First operand 536 states and 822 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:49:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:31,678 INFO L93 Difference]: Finished difference Result 1061 states and 1633 transitions. [2024-11-11 20:49:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:49:31,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2024-11-11 20:49:31,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:31,681 INFO L225 Difference]: With dead ends: 1061 [2024-11-11 20:49:31,681 INFO L226 Difference]: Without dead ends: 538 [2024-11-11 20:49:31,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:49:31,683 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 2 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:31,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2711 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-11 20:49:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-11 20:49:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 417 states have (on average 1.5443645083932853) internal successors, (644), 423 states have internal predecessors, (644), 89 states have call successors, (89), 29 states have call predecessors, (89), 31 states have return successors, (95), 87 states have call predecessors, (95), 88 states have call successors, (95) [2024-11-11 20:49:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 828 transitions. [2024-11-11 20:49:31,702 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 828 transitions. Word has length 122 [2024-11-11 20:49:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:31,702 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 828 transitions. [2024-11-11 20:49:31,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:49:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 828 transitions. [2024-11-11 20:49:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 20:49:31,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:31,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:31,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:49:31,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:31,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:31,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1783283689, now seen corresponding path program 1 times [2024-11-11 20:49:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:31,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974279733] [2024-11-11 20:49:31,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:31,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:49:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:49:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:49:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:49:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:49:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:49:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:49:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:49:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:49:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:49:32,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974279733] [2024-11-11 20:49:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974279733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:32,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:32,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:49:32,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391151719] [2024-11-11 20:49:32,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:32,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:49:32,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:32,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:49:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:49:32,052 INFO L87 Difference]: Start difference. First operand 538 states and 828 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:49:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:34,332 INFO L93 Difference]: Finished difference Result 1287 states and 2007 transitions. [2024-11-11 20:49:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:49:34,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2024-11-11 20:49:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:34,337 INFO L225 Difference]: With dead ends: 1287 [2024-11-11 20:49:34,337 INFO L226 Difference]: Without dead ends: 772 [2024-11-11 20:49:34,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:49:34,339 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1679 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 4015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:34,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 1402 Invalid, 4015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 20:49:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-11 20:49:34,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 538. [2024-11-11 20:49:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 417 states have (on average 1.5443645083932853) internal successors, (644), 423 states have internal predecessors, (644), 89 states have call successors, (89), 29 states have call predecessors, (89), 31 states have return successors, (94), 87 states have call predecessors, (94), 88 states have call successors, (94) [2024-11-11 20:49:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 827 transitions. [2024-11-11 20:49:34,374 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 827 transitions. Word has length 123 [2024-11-11 20:49:34,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:34,374 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 827 transitions. [2024-11-11 20:49:34,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:49:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 827 transitions. [2024-11-11 20:49:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:49:34,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:34,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:34,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:49:34,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:34,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:34,376 INFO L85 PathProgramCache]: Analyzing trace with hash -14687389, now seen corresponding path program 2 times [2024-11-11 20:49:34,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:34,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159461687] [2024-11-11 20:49:34,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:34,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:49:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:49:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:49:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:49:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:49:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:49:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:49:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:49:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:49:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:49:34,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:34,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159461687] [2024-11-11 20:49:34,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159461687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:34,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:34,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:49:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787056095] [2024-11-11 20:49:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:34,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:49:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:34,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:49:34,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:49:34,530 INFO L87 Difference]: Start difference. First operand 538 states and 827 transitions. Second operand has 9 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:49:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:36,573 INFO L93 Difference]: Finished difference Result 1289 states and 2010 transitions. [2024-11-11 20:49:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:49:36,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 124 [2024-11-11 20:49:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:36,577 INFO L225 Difference]: With dead ends: 1289 [2024-11-11 20:49:36,577 INFO L226 Difference]: Without dead ends: 774 [2024-11-11 20:49:36,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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-11-11 20:49:36,579 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 1786 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 3878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:36,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 1401 Invalid, 3878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 20:49:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-11-11 20:49:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 540. [2024-11-11 20:49:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.5430622009569377) internal successors, (645), 425 states have internal predecessors, (645), 89 states have call successors, (89), 29 states have call predecessors, (89), 32 states have return successors, (96), 87 states have call predecessors, (96), 88 states have call successors, (96) [2024-11-11 20:49:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 830 transitions. [2024-11-11 20:49:36,606 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 830 transitions. Word has length 124 [2024-11-11 20:49:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:36,607 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 830 transitions. [2024-11-11 20:49:36,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:49:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 830 transitions. [2024-11-11 20:49:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 20:49:36,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:36,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:36,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:49:36,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:36,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1844049874, now seen corresponding path program 1 times [2024-11-11 20:49:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:36,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124688728] [2024-11-11 20:49:36,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:36,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:49:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:49:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:49:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:49:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:49:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:49:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:49:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:49:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:49:36,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:36,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124688728] [2024-11-11 20:49:36,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124688728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:36,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:36,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:49:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59842346] [2024-11-11 20:49:36,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:36,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:49:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:49:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:49:36,796 INFO L87 Difference]: Start difference. First operand 540 states and 830 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:49:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:39,304 INFO L93 Difference]: Finished difference Result 1287 states and 2005 transitions. [2024-11-11 20:49:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:49:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2024-11-11 20:49:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:39,309 INFO L225 Difference]: With dead ends: 1287 [2024-11-11 20:49:39,309 INFO L226 Difference]: Without dead ends: 774 [2024-11-11 20:49:39,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 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-11-11 20:49:39,311 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1796 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 5228 mSolverCounterSat, 641 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 5869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 641 IncrementalHoareTripleChecker+Valid, 5228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:39,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1797 Valid, 1941 Invalid, 5869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [641 Valid, 5228 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 20:49:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-11-11 20:49:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 540. [2024-11-11 20:49:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.5430622009569377) internal successors, (645), 425 states have internal predecessors, (645), 89 states have call successors, (89), 29 states have call predecessors, (89), 32 states have return successors, (95), 87 states have call predecessors, (95), 88 states have call successors, (95) [2024-11-11 20:49:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 829 transitions. [2024-11-11 20:49:39,340 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 829 transitions. Word has length 125 [2024-11-11 20:49:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:39,340 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 829 transitions. [2024-11-11 20:49:39,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:49:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 829 transitions. [2024-11-11 20:49:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 20:49:39,343 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:39,343 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:39,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:49:39,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:39,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1768213281, now seen corresponding path program 2 times [2024-11-11 20:49:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:39,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334649863] [2024-11-11 20:49:39,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:49:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:49:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:49:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:49:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:49:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:49:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:49:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:49:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:49:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334649863] [2024-11-11 20:49:39,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334649863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:39,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:39,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:49:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891836408] [2024-11-11 20:49:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:39,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:49:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:39,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:49:39,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:49:39,514 INFO L87 Difference]: Start difference. First operand 540 states and 829 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:49:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:41,863 INFO L93 Difference]: Finished difference Result 1289 states and 2011 transitions. [2024-11-11 20:49:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:49:41,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 126 [2024-11-11 20:49:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:41,867 INFO L225 Difference]: With dead ends: 1289 [2024-11-11 20:49:41,867 INFO L226 Difference]: Without dead ends: 776 [2024-11-11 20:49:41,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 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-11-11 20:49:41,869 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 1796 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 5269 mSolverCounterSat, 638 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 5907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 638 IncrementalHoareTripleChecker+Valid, 5269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:41,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1797 Valid, 1944 Invalid, 5907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [638 Valid, 5269 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 20:49:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-11 20:49:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 542. [2024-11-11 20:49:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 419 states have (on average 1.541766109785203) internal successors, (646), 427 states have internal predecessors, (646), 89 states have call successors, (89), 29 states have call predecessors, (89), 33 states have return successors, (100), 87 states have call predecessors, (100), 88 states have call successors, (100) [2024-11-11 20:49:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 835 transitions. [2024-11-11 20:49:41,897 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 835 transitions. Word has length 126 [2024-11-11 20:49:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:41,898 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 835 transitions. [2024-11-11 20:49:41,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:49:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 835 transitions. [2024-11-11 20:49:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 20:49:41,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:41,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:41,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:49:41,900 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:41,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1051089069, now seen corresponding path program 1 times [2024-11-11 20:49:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:41,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351215575] [2024-11-11 20:49:41,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:49:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:49:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:49:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:49:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:49:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:49:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:49:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:49:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-11 20:49:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:42,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351215575] [2024-11-11 20:49:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351215575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:42,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235189744] [2024-11-11 20:49:42,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:42,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:42,109 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:49:42,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:49:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:49:42,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:42,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:49:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:42,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235189744] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:49:42,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:49:42,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-11 20:49:42,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724671991] [2024-11-11 20:49:42,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:49:42,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 20:49:42,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:42,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 20:49:42,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:49:42,496 INFO L87 Difference]: Start difference. First operand 542 states and 835 transitions. Second operand has 15 states, 14 states have (on average 10.285714285714286) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (34), 6 states have call predecessors, (34), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-11 20:49:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:44,926 INFO L93 Difference]: Finished difference Result 1754 states and 2848 transitions. [2024-11-11 20:49:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 20:49:44,927 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.285714285714286) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (34), 6 states have call predecessors, (34), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 127 [2024-11-11 20:49:44,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:44,932 INFO L225 Difference]: With dead ends: 1754 [2024-11-11 20:49:44,932 INFO L226 Difference]: Without dead ends: 1243 [2024-11-11 20:49:44,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 277 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-11-11 20:49:44,935 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 3310 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 5214 mSolverCounterSat, 1042 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3331 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 6256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1042 IncrementalHoareTripleChecker+Valid, 5214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:44,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3331 Valid, 2202 Invalid, 6256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1042 Valid, 5214 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 20:49:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-11-11 20:49:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 985. [2024-11-11 20:49:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 783 states have (on average 1.5989782886334611) internal successors, (1252), 791 states have internal predecessors, (1252), 168 states have call successors, (168), 29 states have call predecessors, (168), 33 states have return successors, (189), 166 states have call predecessors, (189), 167 states have call successors, (189) [2024-11-11 20:49:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1609 transitions. [2024-11-11 20:49:44,976 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1609 transitions. Word has length 127 [2024-11-11 20:49:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:44,976 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1609 transitions. [2024-11-11 20:49:44,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.285714285714286) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (34), 6 states have call predecessors, (34), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-11 20:49:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1609 transitions. [2024-11-11 20:49:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 20:49:44,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:44,980 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:44,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 20:49:45,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:45,184 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:45,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1684173326, now seen corresponding path program 1 times [2024-11-11 20:49:45,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110669295] [2024-11-11 20:49:45,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:49:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:49:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:49:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:49:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:49:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:49:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:49:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:49:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:45,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:45,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110669295] [2024-11-11 20:49:45,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110669295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:45,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:45,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576967847] [2024-11-11 20:49:45,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:45,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:45,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:45,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:45,268 INFO L87 Difference]: Start difference. First operand 985 states and 1609 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:46,674 INFO L93 Difference]: Finished difference Result 2549 states and 4257 transitions. [2024-11-11 20:49:46,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:46,674 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-11 20:49:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:46,686 INFO L225 Difference]: With dead ends: 2549 [2024-11-11 20:49:46,686 INFO L226 Difference]: Without dead ends: 1642 [2024-11-11 20:49:46,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:49:46,690 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1796 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 669 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:46,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1814 Valid, 1093 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [669 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:49:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2024-11-11 20:49:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1400. [2024-11-11 20:49:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1119 states have (on average 1.6193029490616622) internal successors, (1812), 1127 states have internal predecessors, (1812), 247 states have call successors, (247), 29 states have call predecessors, (247), 33 states have return successors, (278), 245 states have call predecessors, (278), 246 states have call successors, (278) [2024-11-11 20:49:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2337 transitions. [2024-11-11 20:49:46,757 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2337 transitions. Word has length 130 [2024-11-11 20:49:46,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:46,757 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 2337 transitions. [2024-11-11 20:49:46,757 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2337 transitions. [2024-11-11 20:49:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:49:46,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:46,762 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:46,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:49:46,762 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:46,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:46,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1439175383, now seen corresponding path program 1 times [2024-11-11 20:49:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:46,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358189995] [2024-11-11 20:49:46,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:49:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:49:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:49:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:49:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:49:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:49:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:49:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:49:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:46,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:46,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358189995] [2024-11-11 20:49:46,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358189995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:46,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:46,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:46,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093496524] [2024-11-11 20:49:46,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:46,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:46,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:46,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:46,841 INFO L87 Difference]: Start difference. First operand 1400 states and 2337 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:48,149 INFO L93 Difference]: Finished difference Result 3588 states and 6070 transitions. [2024-11-11 20:49:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:48,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2024-11-11 20:49:48,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:48,158 INFO L225 Difference]: With dead ends: 3588 [2024-11-11 20:49:48,158 INFO L226 Difference]: Without dead ends: 2319 [2024-11-11 20:49:48,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:49:48,161 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1850 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:48,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 1061 Invalid, 2565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [702 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:49:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-11-11 20:49:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2077. [2024-11-11 20:49:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 1677 states have (on average 1.6302921884317234) internal successors, (2734), 1685 states have internal predecessors, (2734), 366 states have call successors, (366), 29 states have call predecessors, (366), 33 states have return successors, (397), 364 states have call predecessors, (397), 365 states have call successors, (397) [2024-11-11 20:49:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 3497 transitions. [2024-11-11 20:49:48,226 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 3497 transitions. Word has length 131 [2024-11-11 20:49:48,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:48,226 INFO L471 AbstractCegarLoop]: Abstraction has 2077 states and 3497 transitions. [2024-11-11 20:49:48,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 3497 transitions. [2024-11-11 20:49:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 20:49:48,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:48,233 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:48,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:49:48,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:48,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:48,233 INFO L85 PathProgramCache]: Analyzing trace with hash 723238404, now seen corresponding path program 1 times [2024-11-11 20:49:48,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:48,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694084747] [2024-11-11 20:49:48,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:49:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:49:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:49:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:49:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:49:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:49:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:49:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:49:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:48,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694084747] [2024-11-11 20:49:48,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694084747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:48,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:48,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830031352] [2024-11-11 20:49:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:48,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:48,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:48,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:48,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:48,329 INFO L87 Difference]: Start difference. First operand 2077 states and 3497 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:49,636 INFO L93 Difference]: Finished difference Result 5173 states and 8849 transitions. [2024-11-11 20:49:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:49,637 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2024-11-11 20:49:49,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:49,650 INFO L225 Difference]: With dead ends: 5173 [2024-11-11 20:49:49,650 INFO L226 Difference]: Without dead ends: 3362 [2024-11-11 20:49:49,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:49:49,654 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1922 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 714 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:49,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1943 Valid, 1021 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [714 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:49:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2024-11-11 20:49:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3120. [2024-11-11 20:49:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 2558 states have (on average 1.638780297107115) internal successors, (4192), 2566 states have internal predecessors, (4192), 528 states have call successors, (528), 29 states have call predecessors, (528), 33 states have return successors, (575), 526 states have call predecessors, (575), 527 states have call successors, (575) [2024-11-11 20:49:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 5295 transitions. [2024-11-11 20:49:49,778 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 5295 transitions. Word has length 132 [2024-11-11 20:49:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:49,778 INFO L471 AbstractCegarLoop]: Abstraction has 3120 states and 5295 transitions. [2024-11-11 20:49:49,778 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 5295 transitions. [2024-11-11 20:49:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 20:49:49,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:49,790 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:49,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:49:49,791 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:49,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash -240342154, now seen corresponding path program 1 times [2024-11-11 20:49:49,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:49,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859487637] [2024-11-11 20:49:49,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:49:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:49:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:49:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:49:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:49:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:49:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:49:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:49:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:49,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:49,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859487637] [2024-11-11 20:49:49,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859487637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:49,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:49,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:49,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163602498] [2024-11-11 20:49:49,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:49,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:49,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:49,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:49,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:49,896 INFO L87 Difference]: Start difference. First operand 3120 states and 5295 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:51,425 INFO L93 Difference]: Finished difference Result 7687 states and 13264 transitions. [2024-11-11 20:49:51,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2024-11-11 20:49:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:51,444 INFO L225 Difference]: With dead ends: 7687 [2024-11-11 20:49:51,444 INFO L226 Difference]: Without dead ends: 5052 [2024-11-11 20:49:51,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:49:51,449 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 1902 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 669 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:51,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 1023 Invalid, 2543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [669 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:49:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5052 states. [2024-11-11 20:49:51,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5052 to 4810. [2024-11-11 20:49:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4003 states have (on average 1.6447664251811143) internal successors, (6584), 4011 states have internal predecessors, (6584), 773 states have call successors, (773), 29 states have call predecessors, (773), 33 states have return successors, (846), 771 states have call predecessors, (846), 772 states have call successors, (846) [2024-11-11 20:49:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 8203 transitions. [2024-11-11 20:49:51,600 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 8203 transitions. Word has length 133 [2024-11-11 20:49:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:51,600 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 8203 transitions. [2024-11-11 20:49:51,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 8203 transitions. [2024-11-11 20:49:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-11 20:49:51,626 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:51,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:51,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:49:51,627 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:51,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash 884137384, now seen corresponding path program 1 times [2024-11-11 20:49:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945259673] [2024-11-11 20:49:51,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:51,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:49:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:49:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:49:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:49:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:49:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:49:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:49:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 20:49:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:51,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:51,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945259673] [2024-11-11 20:49:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945259673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:51,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:51,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161280631] [2024-11-11 20:49:51,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:51,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:51,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:51,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:51,734 INFO L87 Difference]: Start difference. First operand 4810 states and 8203 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:53,268 INFO L93 Difference]: Finished difference Result 11888 states and 20641 transitions. [2024-11-11 20:49:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:53,269 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2024-11-11 20:49:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:53,302 INFO L225 Difference]: With dead ends: 11888 [2024-11-11 20:49:53,302 INFO L226 Difference]: Without dead ends: 7895 [2024-11-11 20:49:53,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:49:53,315 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1833 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1851 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:53,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1851 Valid, 1042 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:49:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7895 states. [2024-11-11 20:49:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7895 to 7653. [2024-11-11 20:49:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7653 states, 6353 states have (on average 1.6437903352746734) internal successors, (10443), 6361 states have internal predecessors, (10443), 1266 states have call successors, (1266), 29 states have call predecessors, (1266), 33 states have return successors, (1383), 1264 states have call predecessors, (1383), 1265 states have call successors, (1383) [2024-11-11 20:49:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7653 states to 7653 states and 13092 transitions. [2024-11-11 20:49:53,581 INFO L78 Accepts]: Start accepts. Automaton has 7653 states and 13092 transitions. Word has length 134 [2024-11-11 20:49:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:53,582 INFO L471 AbstractCegarLoop]: Abstraction has 7653 states and 13092 transitions. [2024-11-11 20:49:53,582 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 7653 states and 13092 transitions. [2024-11-11 20:49:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-11 20:49:53,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:53,600 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:53,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:49:53,601 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1357659182, now seen corresponding path program 1 times [2024-11-11 20:49:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675829146] [2024-11-11 20:49:53,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:49:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:49:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:49:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:49:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:49:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:49:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:49:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:49:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675829146] [2024-11-11 20:49:53,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675829146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:53,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:53,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:53,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749695104] [2024-11-11 20:49:53,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:53,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:53,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:53,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:53,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:53,693 INFO L87 Difference]: Start difference. First operand 7653 states and 13092 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:55,291 INFO L93 Difference]: Finished difference Result 19503 states and 33917 transitions. [2024-11-11 20:49:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:55,292 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2024-11-11 20:49:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:55,325 INFO L225 Difference]: With dead ends: 19503 [2024-11-11 20:49:55,326 INFO L226 Difference]: Without dead ends: 13069 [2024-11-11 20:49:55,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:49:55,338 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1796 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:55,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1814 Valid, 1025 Invalid, 2601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:49:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13069 states. [2024-11-11 20:49:55,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13069 to 12827. [2024-11-11 20:49:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12827 states, 10705 states have (on average 1.6446520317608595) internal successors, (17606), 10713 states have internal predecessors, (17606), 2088 states have call successors, (2088), 29 states have call predecessors, (2088), 33 states have return successors, (2283), 2086 states have call predecessors, (2283), 2087 states have call successors, (2283) [2024-11-11 20:49:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12827 states to 12827 states and 21977 transitions. [2024-11-11 20:49:55,720 INFO L78 Accepts]: Start accepts. Automaton has 12827 states and 21977 transitions. Word has length 135 [2024-11-11 20:49:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:55,721 INFO L471 AbstractCegarLoop]: Abstraction has 12827 states and 21977 transitions. [2024-11-11 20:49:55,721 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 12827 states and 21977 transitions. [2024-11-11 20:49:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-11 20:49:55,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:55,744 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:55,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:49:55,744 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:55,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:55,744 INFO L85 PathProgramCache]: Analyzing trace with hash 748994394, now seen corresponding path program 1 times [2024-11-11 20:49:55,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:55,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427098039] [2024-11-11 20:49:55,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:55,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:49:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:49:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:49:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:49:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:49:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:49:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:49:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 20:49:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427098039] [2024-11-11 20:49:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427098039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:55,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788368279] [2024-11-11 20:49:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:55,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:55,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:55,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:55,835 INFO L87 Difference]: Start difference. First operand 12827 states and 21977 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:57,455 INFO L93 Difference]: Finished difference Result 30986 states and 53617 transitions. [2024-11-11 20:49:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:57,456 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2024-11-11 20:49:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:57,519 INFO L225 Difference]: With dead ends: 30986 [2024-11-11 20:49:57,617 INFO L226 Difference]: Without dead ends: 20382 [2024-11-11 20:49:57,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:49:57,644 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1796 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 682 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:57,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 1028 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [682 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:49:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20382 states. [2024-11-11 20:49:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20382 to 20140. [2024-11-11 20:49:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20140 states, 16815 states have (on average 1.6206958073148974) internal successors, (27252), 16823 states have internal predecessors, (27252), 3291 states have call successors, (3291), 29 states have call predecessors, (3291), 33 states have return successors, (3630), 3289 states have call predecessors, (3630), 3290 states have call successors, (3630) [2024-11-11 20:49:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20140 states to 20140 states and 34173 transitions. [2024-11-11 20:49:58,359 INFO L78 Accepts]: Start accepts. Automaton has 20140 states and 34173 transitions. Word has length 136 [2024-11-11 20:49:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:58,360 INFO L471 AbstractCegarLoop]: Abstraction has 20140 states and 34173 transitions. [2024-11-11 20:49:58,360 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:49:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 20140 states and 34173 transitions. [2024-11-11 20:49:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 20:49:58,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:58,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:58,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:49:58,383 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2047230127, now seen corresponding path program 1 times [2024-11-11 20:49:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:58,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533416254] [2024-11-11 20:49:58,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:49:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:49:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:49:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:49:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:49:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:49:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:49:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 20:49:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:58,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533416254] [2024-11-11 20:49:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533416254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:58,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:58,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:58,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955565838] [2024-11-11 20:49:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:58,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:58,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:58,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:58,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:58,464 INFO L87 Difference]: Start difference. First operand 20140 states and 34173 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:50:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:00,540 INFO L93 Difference]: Finished difference Result 53428 states and 92151 transitions. [2024-11-11 20:50:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:00,540 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2024-11-11 20:50:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:00,645 INFO L225 Difference]: With dead ends: 53428 [2024-11-11 20:50:00,645 INFO L226 Difference]: Without dead ends: 36188 [2024-11-11 20:50:00,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:50:00,672 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 1871 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 685 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:00,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 1024 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [685 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:50:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36188 states. [2024-11-11 20:50:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36188 to 35946. [2024-11-11 20:50:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35946 states, 30171 states have (on average 1.6179112392694972) internal successors, (48814), 30179 states have internal predecessors, (48814), 5741 states have call successors, (5741), 29 states have call predecessors, (5741), 33 states have return successors, (6354), 5739 states have call predecessors, (6354), 5740 states have call successors, (6354) [2024-11-11 20:50:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35946 states to 35946 states and 60909 transitions. [2024-11-11 20:50:01,977 INFO L78 Accepts]: Start accepts. Automaton has 35946 states and 60909 transitions. Word has length 137 [2024-11-11 20:50:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:01,978 INFO L471 AbstractCegarLoop]: Abstraction has 35946 states and 60909 transitions. [2024-11-11 20:50:01,978 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:50:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 35946 states and 60909 transitions. [2024-11-11 20:50:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 20:50:02,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:02,009 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:02,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:50:02,009 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:02,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash 253409376, now seen corresponding path program 1 times [2024-11-11 20:50:02,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:02,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292531028] [2024-11-11 20:50:02,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:02,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:50:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:50:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:50:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:50:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:50:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:50:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:50:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 20:50:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:02,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:02,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292531028] [2024-11-11 20:50:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292531028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:02,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714558205] [2024-11-11 20:50:02,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:02,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:02,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:02,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:02,112 INFO L87 Difference]: Start difference. First operand 35946 states and 60909 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:50:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:04,734 INFO L93 Difference]: Finished difference Result 98275 states and 168710 transitions. [2024-11-11 20:50:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:04,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2024-11-11 20:50:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:04,926 INFO L225 Difference]: With dead ends: 98275 [2024-11-11 20:50:04,926 INFO L226 Difference]: Without dead ends: 66185 [2024-11-11 20:50:05,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:50:05,001 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1875 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1894 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:05,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1894 Valid, 1027 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [718 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:50:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66185 states. [2024-11-11 20:50:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66185 to 65943. [2024-11-11 20:50:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65943 states, 55655 states have (on average 1.613996945467613) internal successors, (89827), 55663 states have internal predecessors, (89827), 10254 states have call successors, (10254), 29 states have call predecessors, (10254), 33 states have return successors, (11399), 10252 states have call predecessors, (11399), 10253 states have call successors, (11399) [2024-11-11 20:50:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65943 states to 65943 states and 111480 transitions. [2024-11-11 20:50:07,174 INFO L78 Accepts]: Start accepts. Automaton has 65943 states and 111480 transitions. Word has length 138 [2024-11-11 20:50:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:07,175 INFO L471 AbstractCegarLoop]: Abstraction has 65943 states and 111480 transitions. [2024-11-11 20:50:07,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:50:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 65943 states and 111480 transitions. [2024-11-11 20:50:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 20:50:07,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:07,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:07,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:50:07,208 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:07,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:07,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1496473903, now seen corresponding path program 1 times [2024-11-11 20:50:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:07,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58783269] [2024-11-11 20:50:07,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:07,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:50:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:50:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:50:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:50:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:50:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:50:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:50:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 20:50:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:07,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:07,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58783269] [2024-11-11 20:50:07,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58783269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:07,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:07,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:07,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223844387] [2024-11-11 20:50:07,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:07,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:07,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:07,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:07,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:07,305 INFO L87 Difference]: Start difference. First operand 65943 states and 111480 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:50:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:11,140 INFO L93 Difference]: Finished difference Result 123936 states and 213143 transitions. [2024-11-11 20:50:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:11,141 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2024-11-11 20:50:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:11,571 INFO L225 Difference]: With dead ends: 123936 [2024-11-11 20:50:11,571 INFO L226 Difference]: Without dead ends: 123673 [2024-11-11 20:50:11,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:50:11,631 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 1762 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:11,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 1065 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [648 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:50:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123673 states. [2024-11-11 20:50:15,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123673 to 123431. [2024-11-11 20:50:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123431 states, 104775 states have (on average 1.6089620615604867) internal successors, (168579), 104783 states have internal predecessors, (168579), 18622 states have call successors, (18622), 29 states have call predecessors, (18622), 33 states have return successors, (20813), 18620 states have call predecessors, (20813), 18621 states have call successors, (20813) [2024-11-11 20:50:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123431 states to 123431 states and 208014 transitions. [2024-11-11 20:50:16,192 INFO L78 Accepts]: Start accepts. Automaton has 123431 states and 208014 transitions. Word has length 139 [2024-11-11 20:50:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:16,192 INFO L471 AbstractCegarLoop]: Abstraction has 123431 states and 208014 transitions. [2024-11-11 20:50:16,192 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:50:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 123431 states and 208014 transitions. [2024-11-11 20:50:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 20:50:16,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:16,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:16,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:50:16,221 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:16,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash 397812833, now seen corresponding path program 1 times [2024-11-11 20:50:16,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:16,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449998177] [2024-11-11 20:50:16,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:16,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:50:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:50:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:50:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:50:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:50:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:50:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:50:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:50:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:16,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449998177] [2024-11-11 20:50:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449998177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:16,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-11 20:50:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563193855] [2024-11-11 20:50:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:16,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 20:50:16,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:16,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 20:50:16,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:50:16,666 INFO L87 Difference]: Start difference. First operand 123431 states and 208014 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-11 20:50:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:28,141 INFO L93 Difference]: Finished difference Result 247119 states and 428379 transitions. [2024-11-11 20:50:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-11 20:50:28,142 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 140 [2024-11-11 20:50:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:29,063 INFO L225 Difference]: With dead ends: 247119 [2024-11-11 20:50:29,063 INFO L226 Difference]: Without dead ends: 246862 [2024-11-11 20:50:29,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=900, Invalid=4070, Unknown=0, NotChecked=0, Total=4970 [2024-11-11 20:50:29,145 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 6949 mSDsluCounter, 3290 mSDsCounter, 0 mSdLazyCounter, 12088 mSolverCounterSat, 2679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6949 SdHoareTripleChecker+Valid, 3562 SdHoareTripleChecker+Invalid, 14767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2679 IncrementalHoareTripleChecker+Valid, 12088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:29,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6949 Valid, 3562 Invalid, 14767 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2679 Valid, 12088 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-11 20:50:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246862 states. [2024-11-11 20:50:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246862 to 245931. [2024-11-11 20:50:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245931 states, 208783 states have (on average 1.6093312194958402) internal successors, (336001), 208693 states have internal predecessors, (336001), 37058 states have call successors, (37058), 78 states have call predecessors, (37058), 89 states have return successors, (44748), 37167 states have call predecessors, (44748), 37055 states have call successors, (44748) [2024-11-11 20:50:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245931 states to 245931 states and 417807 transitions. [2024-11-11 20:50:38,265 INFO L78 Accepts]: Start accepts. Automaton has 245931 states and 417807 transitions. Word has length 140 [2024-11-11 20:50:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:38,265 INFO L471 AbstractCegarLoop]: Abstraction has 245931 states and 417807 transitions. [2024-11-11 20:50:38,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-11 20:50:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 245931 states and 417807 transitions. [2024-11-11 20:50:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 20:50:38,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:38,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:50:38,337 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:38,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1434576529, now seen corresponding path program 1 times [2024-11-11 20:50:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288503371] [2024-11-11 20:50:38,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat