./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_productSimulator.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_spec11_productSimulator.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 1c5af94617941f44648ac9498189d5e73562b4cbf6ae0ea00b10262137b50bb0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:38:38,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:38:38,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:38:38,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:38:38,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:38:38,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:38:38,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:38:38,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:38:38,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:38:38,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:38:38,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:38:38,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:38:38,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:38:38,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:38:38,661 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:38:38,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:38:38,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:38:38,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:38:38,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:38:38,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:38:38,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:38:38,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:38:38,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:38:38,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:38:38,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:38:38,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:38:38,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:38:38,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:38:38,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:38:38,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:38:38,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:38:38,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:38:38,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:38:38,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:38:38,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:38:38,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:38:38,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:38:38,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:38:38,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:38:38,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:38:38,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:38:38,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:38:38,671 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 -> 1c5af94617941f44648ac9498189d5e73562b4cbf6ae0ea00b10262137b50bb0 [2024-11-11 20:38:38,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:38:38,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:38:39,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:38:39,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:38:39,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:38:39,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c [2024-11-11 20:38:40,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:38:40,780 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:38:40,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c [2024-11-11 20:38:40,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1bf33c2c/b3d05facd2eb4e9f8ea31589d2c905fc/FLAGab3edb9bb [2024-11-11 20:38:41,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1bf33c2c/b3d05facd2eb4e9f8ea31589d2c905fc [2024-11-11 20:38:41,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:38:41,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:38:41,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:38:41,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:38:41,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:38:41,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:41,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d50723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41, skipping insertion in model container [2024-11-11 20:38:41,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:41,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:38:41,688 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_spec11_productSimulator.cil.c[48047,48060] [2024-11-11 20:38:41,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:38:41,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:38:41,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-11-11 20:38:41,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [168] [2024-11-11 20:38:41,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [754] [2024-11-11 20:38:41,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1126] [2024-11-11 20:38:41,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1492] [2024-11-11 20:38:41,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1698] [2024-11-11 20:38:41,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2095] [2024-11-11 20:38:41,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2112] [2024-11-11 20:38:41,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2378] [2024-11-11 20:38:41,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2387] [2024-11-11 20:38:41,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [3447] [2024-11-11 20:38:41,847 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_spec11_productSimulator.cil.c[48047,48060] [2024-11-11 20:38:41,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:38:41,915 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:38:41,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41 WrapperNode [2024-11-11 20:38:41,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:38:41,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:38:41,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:38:41,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:38:41,924 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:38:41" (1/1) ... [2024-11-11 20:38:41,961 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:38:41" (1/1) ... [2024-11-11 20:38:42,009 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1311 [2024-11-11 20:38:42,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:38:42,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:38:42,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:38:42,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:38:42,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:42,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:42,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:42,100 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:38:42,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:42,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:42,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:42,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:42,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:42,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:42,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:38:42,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:38:42,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:38:42,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:38:42,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (1/1) ... [2024-11-11 20:38:42,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:38:42,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:42,200 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:38:42,214 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:38:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-11 20:38:42,355 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-11 20:38:42,355 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2024-11-11 20:38:42,355 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2024-11-11 20:38:42,355 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2024-11-11 20:38:42,356 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2024-11-11 20:38:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-11-11 20:38:42,356 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-11-11 20:38:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:38:42,356 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:38:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-11-11 20:38:42,356 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-11-11 20:38:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:38:42,356 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:38:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2024-11-11 20:38:42,356 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2024-11-11 20:38:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:38:42,357 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:38:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2024-11-11 20:38:42,357 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2024-11-11 20:38:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:38:42,357 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:38:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:38:42,357 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:38:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:38:42,357 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:38:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2024-11-11 20:38:42,357 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2024-11-11 20:38:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2024-11-11 20:38:42,358 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2024-11-11 20:38:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:38:42,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:38:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:38:42,358 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:38:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:38:42,358 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:38:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2024-11-11 20:38:42,358 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2024-11-11 20:38:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:38:42,359 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:38:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-11-11 20:38:42,359 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-11-11 20:38:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:38:42,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:38:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2024-11-11 20:38:42,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2024-11-11 20:38:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:38:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:38:42,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:38:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-11 20:38:42,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-11 20:38:42,364 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2024-11-11 20:38:42,364 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2024-11-11 20:38:42,364 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2024-11-11 20:38:42,364 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2024-11-11 20:38:42,364 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2024-11-11 20:38:42,364 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2024-11-11 20:38:42,364 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-11-11 20:38:42,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-11-11 20:38:42,364 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:38:42,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:38:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:38:42,365 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:38:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:38:42,365 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:38:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:38:42,365 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:38:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:38:42,365 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:38:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:38:42,365 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:38:42,366 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2024-11-11 20:38:42,366 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2024-11-11 20:38:42,366 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2024-11-11 20:38:42,366 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2024-11-11 20:38:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:38:42,368 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:38:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:38:42,369 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:38:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:38:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:38:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:38:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:38:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:38:42,369 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:38:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2024-11-11 20:38:42,369 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2024-11-11 20:38:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2024-11-11 20:38:42,369 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2024-11-11 20:38:42,369 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-11-11 20:38:42,370 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-11-11 20:38:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:38:42,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:38:42,630 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:38:42,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:38:43,934 INFO L? ?]: Removed 626 outVars from TransFormulas that were not future-live. [2024-11-11 20:38:43,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:38:43,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:38:43,968 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:38:43,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:38:43 BoogieIcfgContainer [2024-11-11 20:38:43,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:38:43,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:38:43,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:38:43,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:38:43,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:38:41" (1/3) ... [2024-11-11 20:38:43,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3968bf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:38:43, skipping insertion in model container [2024-11-11 20:38:43,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:41" (2/3) ... [2024-11-11 20:38:43,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3968bf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:38:43, skipping insertion in model container [2024-11-11 20:38:43,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:38:43" (3/3) ... [2024-11-11 20:38:43,982 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec11_productSimulator.cil.c [2024-11-11 20:38:43,999 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:38:43,999 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:38:44,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:38:44,104 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;@785a0d59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:38:44,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:38:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 600 states, 446 states have (on average 1.515695067264574) internal successors, (676), 466 states have internal predecessors, (676), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2024-11-11 20:38:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 20:38:44,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:44,145 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:44,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:44,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:44,154 INFO L85 PathProgramCache]: Analyzing trace with hash 948796570, now seen corresponding path program 1 times [2024-11-11 20:38:44,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:44,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482626976] [2024-11-11 20:38:44,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:44,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:38:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:38:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:38:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:38:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:38:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:38:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:38:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:38:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:38:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:38:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:38:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:38:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:38:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:38:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-11 20:38:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 20:38:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:38:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-11 20:38:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:44,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482626976] [2024-11-11 20:38:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482626976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:44,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:38:44,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:38:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791542511] [2024-11-11 20:38:44,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:44,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:38:44,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:44,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:38:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:38:44,824 INFO L87 Difference]: Start difference. First operand has 600 states, 446 states have (on average 1.515695067264574) internal successors, (676), 466 states have internal predecessors, (676), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:38:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:46,954 INFO L93 Difference]: Finished difference Result 1063 states and 1612 transitions. [2024-11-11 20:38:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:38:46,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 156 [2024-11-11 20:38:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:46,986 INFO L225 Difference]: With dead ends: 1063 [2024-11-11 20:38:46,986 INFO L226 Difference]: Without dead ends: 725 [2024-11-11 20:38:46,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:38:46,997 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 1378 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:46,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 1034 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 20:38:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-11 20:38:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 593. [2024-11-11 20:38:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 440 states have (on average 1.5113636363636365) internal successors, (665), 459 states have internal predecessors, (665), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-11 20:38:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 882 transitions. [2024-11-11 20:38:47,166 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 882 transitions. Word has length 156 [2024-11-11 20:38:47,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:47,166 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 882 transitions. [2024-11-11 20:38:47,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:38:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 882 transitions. [2024-11-11 20:38:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 20:38:47,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:47,178 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:47,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:38:47,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:47,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash -5020848, now seen corresponding path program 1 times [2024-11-11 20:38:47,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:47,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506853728] [2024-11-11 20:38:47,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:38:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:38:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:38:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:38:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:38:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:38:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:38:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:38:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:38:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:38:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:38:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:38:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:38:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:38:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 20:38:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-11 20:38:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:38:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-11 20:38:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:47,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506853728] [2024-11-11 20:38:47,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506853728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:47,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:38:47,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:38:47,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002746673] [2024-11-11 20:38:47,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:47,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:38:47,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:38:47,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:38:47,576 INFO L87 Difference]: Start difference. First operand 593 states and 882 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:38:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:50,289 INFO L93 Difference]: Finished difference Result 1282 states and 1935 transitions. [2024-11-11 20:38:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:38:50,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2024-11-11 20:38:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:50,296 INFO L225 Difference]: With dead ends: 1282 [2024-11-11 20:38:50,296 INFO L226 Difference]: Without dead ends: 725 [2024-11-11 20:38:50,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:38:50,300 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 1375 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 3245 mSolverCounterSat, 601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 3846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 3245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:50,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 1783 Invalid, 3846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 3245 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 20:38:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-11 20:38:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 593. [2024-11-11 20:38:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 440 states have (on average 1.4954545454545454) internal successors, (658), 459 states have internal predecessors, (658), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-11 20:38:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 875 transitions. [2024-11-11 20:38:50,364 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 875 transitions. Word has length 157 [2024-11-11 20:38:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:50,365 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 875 transitions. [2024-11-11 20:38:50,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:38:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 875 transitions. [2024-11-11 20:38:50,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-11 20:38:50,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:50,371 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:50,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:38:50,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:50,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1028039332, now seen corresponding path program 1 times [2024-11-11 20:38:50,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:50,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837254714] [2024-11-11 20:38:50,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:50,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:38:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:38:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:38:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:38:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:38:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:38:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:38:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:38:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:38:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:38:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:38:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:38:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:38:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:38:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-11 20:38:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-11 20:38:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:38:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-11 20:38:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:50,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837254714] [2024-11-11 20:38:50,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837254714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:50,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541565072] [2024-11-11 20:38:50,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:50,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:50,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:50,753 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:38:50,755 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:38:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:38:51,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-11 20:38:51,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:51,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541565072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:51,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:51,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-11-11 20:38:51,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262470732] [2024-11-11 20:38:51,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:51,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:38:51,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:51,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:38:51,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:38:51,171 INFO L87 Difference]: Start difference. First operand 593 states and 875 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:38:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:51,224 INFO L93 Difference]: Finished difference Result 921 states and 1333 transitions. [2024-11-11 20:38:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:38:51,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 162 [2024-11-11 20:38:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:51,229 INFO L225 Difference]: With dead ends: 921 [2024-11-11 20:38:51,229 INFO L226 Difference]: Without dead ends: 596 [2024-11-11 20:38:51,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:38:51,232 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1744 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:38:51,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1744 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:38:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-11 20:38:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 595. [2024-11-11 20:38:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 442 states have (on average 1.493212669683258) internal successors, (660), 461 states have internal predecessors, (660), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-11 20:38:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 877 transitions. [2024-11-11 20:38:51,288 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 877 transitions. Word has length 162 [2024-11-11 20:38:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:51,288 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 877 transitions. [2024-11-11 20:38:51,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:38:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 877 transitions. [2024-11-11 20:38:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 20:38:51,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:51,292 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:51,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 20:38:51,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:51,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:51,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash -872551131, now seen corresponding path program 1 times [2024-11-11 20:38:51,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:51,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138003177] [2024-11-11 20:38:51,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:51,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:38:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:38:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:38:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:38:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:38:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:38:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:38:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:38:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:38:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:38:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:38:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:38:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:38:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 20:38:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-11 20:38:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-11 20:38:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:38:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-11 20:38:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:51,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138003177] [2024-11-11 20:38:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138003177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966397082] [2024-11-11 20:38:51,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:51,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:51,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:51,882 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:38:51,886 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:38:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:38:52,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-11 20:38:52,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:52,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966397082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:52,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:52,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-11-11 20:38:52,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269477511] [2024-11-11 20:38:52,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:52,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:38:52,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:52,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:38:52,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:38:52,339 INFO L87 Difference]: Start difference. First operand 595 states and 877 transitions. Second operand has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-11 20:38:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:52,468 INFO L93 Difference]: Finished difference Result 1137 states and 1683 transitions. [2024-11-11 20:38:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:38:52,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 169 [2024-11-11 20:38:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:52,473 INFO L225 Difference]: With dead ends: 1137 [2024-11-11 20:38:52,473 INFO L226 Difference]: Without dead ends: 600 [2024-11-11 20:38:52,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:38:52,476 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 4 mSDsluCounter, 4297 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5160 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:52,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5160 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:38:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-11 20:38:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 599. [2024-11-11 20:38:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 444 states have (on average 1.490990990990991) internal successors, (662), 464 states have internal predecessors, (662), 109 states have call successors, (109), 43 states have call predecessors, (109), 45 states have return successors, (112), 108 states have call predecessors, (112), 108 states have call successors, (112) [2024-11-11 20:38:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 883 transitions. [2024-11-11 20:38:52,566 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 883 transitions. Word has length 169 [2024-11-11 20:38:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:52,567 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 883 transitions. [2024-11-11 20:38:52,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-11 20:38:52,567 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 883 transitions. [2024-11-11 20:38:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-11 20:38:52,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:52,572 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:38:52,592 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:38:52,772 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,SelfDestructingSolverStorable3 [2024-11-11 20:38:52,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:52,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:52,774 INFO L85 PathProgramCache]: Analyzing trace with hash -540097728, now seen corresponding path program 1 times [2024-11-11 20:38:52,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:52,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570237882] [2024-11-11 20:38:52,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:38:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:38:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:38:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:38:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:38:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:38:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:38:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:38:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:38:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:38:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:38:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:38:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 20:38:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:38:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-11 20:38:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-11 20:38:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:38:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-11 20:38:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570237882] [2024-11-11 20:38:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570237882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:53,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:38:53,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:38:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304171578] [2024-11-11 20:38:53,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:53,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:38:53,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:38:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:38:53,075 INFO L87 Difference]: Start difference. First operand 599 states and 883 transitions. Second operand has 10 states, 9 states have (on average 11.11111111111111) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-11 20:38:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:56,111 INFO L93 Difference]: Finished difference Result 1255 states and 1890 transitions. [2024-11-11 20:38:56,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 20:38:56,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.11111111111111) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 170 [2024-11-11 20:38:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:56,117 INFO L225 Difference]: With dead ends: 1255 [2024-11-11 20:38:56,118 INFO L226 Difference]: Without dead ends: 734 [2024-11-11 20:38:56,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:38:56,121 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1361 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 4732 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 2262 SdHoareTripleChecker+Invalid, 5321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 4732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:56,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 2262 Invalid, 5321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 4732 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 20:38:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-11-11 20:38:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 601. [2024-11-11 20:38:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 445 states have (on average 1.489887640449438) internal successors, (663), 465 states have internal predecessors, (663), 109 states have call successors, (109), 43 states have call predecessors, (109), 46 states have return successors, (113), 109 states have call predecessors, (113), 108 states have call successors, (113) [2024-11-11 20:38:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 885 transitions. [2024-11-11 20:38:56,167 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 885 transitions. Word has length 170 [2024-11-11 20:38:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:56,167 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 885 transitions. [2024-11-11 20:38:56,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.11111111111111) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-11 20:38:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 885 transitions. [2024-11-11 20:38:56,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-11 20:38:56,171 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:56,172 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:38:56,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:56,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:56,173 INFO L85 PathProgramCache]: Analyzing trace with hash -445705328, now seen corresponding path program 2 times [2024-11-11 20:38:56,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:56,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518446790] [2024-11-11 20:38:56,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:56,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:38:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:38:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:38:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:38:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:38:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:38:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:38:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:38:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:38:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:38:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:38:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:38:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:38:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 20:38:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-11 20:38:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-11 20:38:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:38:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-11 20:38:56,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518446790] [2024-11-11 20:38:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518446790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:38:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:38:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177902915] [2024-11-11 20:38:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:56,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:38:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:38:56,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:38:56,492 INFO L87 Difference]: Start difference. First operand 601 states and 885 transitions. Second operand has 10 states, 9 states have (on average 11.222222222222221) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-11 20:38:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:59,394 INFO L93 Difference]: Finished difference Result 1259 states and 1896 transitions. [2024-11-11 20:38:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 20:38:59,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.222222222222221) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 171 [2024-11-11 20:38:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:59,400 INFO L225 Difference]: With dead ends: 1259 [2024-11-11 20:38:59,400 INFO L226 Difference]: Without dead ends: 738 [2024-11-11 20:38:59,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:38:59,404 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1367 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 4764 mSolverCounterSat, 580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 5344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 580 IncrementalHoareTripleChecker+Valid, 4764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:59,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 2261 Invalid, 5344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [580 Valid, 4764 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 20:38:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-11 20:38:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 603. [2024-11-11 20:38:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 446 states have (on average 1.4887892376681615) internal successors, (664), 467 states have internal predecessors, (664), 109 states have call successors, (109), 43 states have call predecessors, (109), 47 states have return successors, (116), 109 states have call predecessors, (116), 108 states have call successors, (116) [2024-11-11 20:38:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 889 transitions. [2024-11-11 20:38:59,471 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 889 transitions. Word has length 171 [2024-11-11 20:38:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:59,471 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 889 transitions. [2024-11-11 20:38:59,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.222222222222221) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-11 20:38:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 889 transitions. [2024-11-11 20:38:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-11 20:38:59,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:59,476 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:38:59,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:38:59,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:59,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:59,477 INFO L85 PathProgramCache]: Analyzing trace with hash -329663574, now seen corresponding path program 1 times [2024-11-11 20:38:59,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:59,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261868586] [2024-11-11 20:38:59,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:59,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:38:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:38:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:38:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:38:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:38:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:38:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:38:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:38:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:38:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:38:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:38:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:38:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:38:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 20:38:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-11 20:38:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 20:38:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-11 20:38:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:38:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:38:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:59,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261868586] [2024-11-11 20:38:59,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261868586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357522449] [2024-11-11 20:38:59,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:59,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:59,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:59,707 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:38:59,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:39:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 1424 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:39:00,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:39:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:00,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:39:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357522449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:39:00,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:39:00,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-11 20:39:00,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766688954] [2024-11-11 20:39:00,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:39:00,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:39:00,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:00,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:39:00,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:00,266 INFO L87 Difference]: Start difference. First operand 603 states and 889 transitions. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 7 states have internal predecessors, (138), 2 states have call successors, (45), 5 states have call predecessors, (45), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-11 20:39:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:02,335 INFO L93 Difference]: Finished difference Result 1441 states and 2224 transitions. [2024-11-11 20:39:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:39:02,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 7 states have internal predecessors, (138), 2 states have call successors, (45), 5 states have call predecessors, (45), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2024-11-11 20:39:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:02,342 INFO L225 Difference]: With dead ends: 1441 [2024-11-11 20:39:02,342 INFO L226 Difference]: Without dead ends: 1116 [2024-11-11 20:39:02,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:39:02,344 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 2038 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:02,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 1904 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 20:39:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-11 20:39:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 960. [2024-11-11 20:39:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 752 states have (on average 1.565159574468085) internal successors, (1177), 779 states have internal predecessors, (1177), 160 states have call successors, (160), 43 states have call predecessors, (160), 47 states have return successors, (167), 160 states have call predecessors, (167), 159 states have call successors, (167) [2024-11-11 20:39:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1504 transitions. [2024-11-11 20:39:02,425 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1504 transitions. Word has length 172 [2024-11-11 20:39:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:02,426 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1504 transitions. [2024-11-11 20:39:02,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 7 states have internal predecessors, (138), 2 states have call successors, (45), 5 states have call predecessors, (45), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-11 20:39:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1504 transitions. [2024-11-11 20:39:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-11 20:39:02,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:02,431 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:02,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 20:39:02,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:02,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:02,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1471433482, now seen corresponding path program 1 times [2024-11-11 20:39:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:02,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467520264] [2024-11-11 20:39:02,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:02,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:39:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:39:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 20:39:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 20:39:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-11 20:39:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 20:39:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:02,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:02,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467520264] [2024-11-11 20:39:02,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467520264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:02,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:02,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:02,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661697817] [2024-11-11 20:39:02,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:02,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:02,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:02,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:02,767 INFO L87 Difference]: Start difference. First operand 960 states and 1504 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:04,366 INFO L93 Difference]: Finished difference Result 2215 states and 3537 transitions. [2024-11-11 20:39:04,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:04,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-11 20:39:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:04,374 INFO L225 Difference]: With dead ends: 2215 [2024-11-11 20:39:04,374 INFO L226 Difference]: Without dead ends: 1372 [2024-11-11 20:39:04,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:04,377 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1526 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:04,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 1227 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:39:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-11-11 20:39:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1232. [2024-11-11 20:39:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 982 states have (on average 1.579429735234216) internal successors, (1551), 1015 states have internal predecessors, (1551), 202 states have call successors, (202), 43 states have call predecessors, (202), 47 states have return successors, (209), 202 states have call predecessors, (209), 201 states have call successors, (209) [2024-11-11 20:39:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1962 transitions. [2024-11-11 20:39:04,435 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1962 transitions. Word has length 177 [2024-11-11 20:39:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:04,435 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1962 transitions. [2024-11-11 20:39:04,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1962 transitions. [2024-11-11 20:39:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 20:39:04,442 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:04,442 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:04,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:39:04,442 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:04,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash -853242770, now seen corresponding path program 1 times [2024-11-11 20:39:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:04,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533015795] [2024-11-11 20:39:04,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:39:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:39:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-11 20:39:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-11 20:39:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-11 20:39:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-11 20:39:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533015795] [2024-11-11 20:39:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533015795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:04,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376354867] [2024-11-11 20:39:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:04,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:04,580 INFO L87 Difference]: Start difference. First operand 1232 states and 1962 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:06,317 INFO L93 Difference]: Finished difference Result 2966 states and 4816 transitions. [2024-11-11 20:39:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:06,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2024-11-11 20:39:06,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:06,344 INFO L225 Difference]: With dead ends: 2966 [2024-11-11 20:39:06,344 INFO L226 Difference]: Without dead ends: 1873 [2024-11-11 20:39:06,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:06,357 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 1535 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 636 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:06,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 1236 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [636 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:39:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2024-11-11 20:39:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1733. [2024-11-11 20:39:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1404 states have (on average 1.599002849002849) internal successors, (2245), 1447 states have internal predecessors, (2245), 281 states have call successors, (281), 43 states have call predecessors, (281), 47 states have return successors, (288), 281 states have call predecessors, (288), 280 states have call successors, (288) [2024-11-11 20:39:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2814 transitions. [2024-11-11 20:39:06,445 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2814 transitions. Word has length 178 [2024-11-11 20:39:06,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:06,445 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2814 transitions. [2024-11-11 20:39:06,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2814 transitions. [2024-11-11 20:39:06,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 20:39:06,454 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:06,455 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:06,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:39:06,455 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:06,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:06,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1379798912, now seen corresponding path program 1 times [2024-11-11 20:39:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:06,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826470924] [2024-11-11 20:39:06,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:39:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:39:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 20:39:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 20:39:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-11 20:39:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-11 20:39:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:06,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:06,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826470924] [2024-11-11 20:39:06,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826470924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:06,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:06,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806587786] [2024-11-11 20:39:06,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:06,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:06,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:06,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:06,590 INFO L87 Difference]: Start difference. First operand 1733 states and 2814 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:08,134 INFO L93 Difference]: Finished difference Result 4213 states and 6941 transitions. [2024-11-11 20:39:08,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:08,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 179 [2024-11-11 20:39:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:08,149 INFO L225 Difference]: With dead ends: 4213 [2024-11-11 20:39:08,149 INFO L226 Difference]: Without dead ends: 2682 [2024-11-11 20:39:08,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:08,155 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1549 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:08,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 1269 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [648 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:39:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2024-11-11 20:39:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2542. [2024-11-11 20:39:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 2094 states have (on average 1.6131805157593124) internal successors, (3378), 2153 states have internal predecessors, (3378), 400 states have call successors, (400), 43 states have call predecessors, (400), 47 states have return successors, (407), 400 states have call predecessors, (407), 399 states have call successors, (407) [2024-11-11 20:39:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4185 transitions. [2024-11-11 20:39:08,261 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4185 transitions. Word has length 179 [2024-11-11 20:39:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:08,262 INFO L471 AbstractCegarLoop]: Abstraction has 2542 states and 4185 transitions. [2024-11-11 20:39:08,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4185 transitions. [2024-11-11 20:39:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-11 20:39:08,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:08,276 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:08,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:39:08,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:08,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:08,278 INFO L85 PathProgramCache]: Analyzing trace with hash -655936266, now seen corresponding path program 1 times [2024-11-11 20:39:08,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:08,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613450409] [2024-11-11 20:39:08,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:08,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:39:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:39:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 20:39:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 20:39:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-11 20:39:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-11 20:39:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:08,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:08,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613450409] [2024-11-11 20:39:08,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613450409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:08,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:08,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:08,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053150338] [2024-11-11 20:39:08,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:08,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:08,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:08,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:08,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:08,421 INFO L87 Difference]: Start difference. First operand 2542 states and 4185 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:10,232 INFO L93 Difference]: Finished difference Result 6112 states and 10173 transitions. [2024-11-11 20:39:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 180 [2024-11-11 20:39:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:10,252 INFO L225 Difference]: With dead ends: 6112 [2024-11-11 20:39:10,252 INFO L226 Difference]: Without dead ends: 3929 [2024-11-11 20:39:10,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:10,263 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 1535 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:10,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 1240 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:39:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3929 states. [2024-11-11 20:39:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3929 to 3789. [2024-11-11 20:39:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3789 states, 3179 states have (on average 1.6240956275558351) internal successors, (5163), 3264 states have internal predecessors, (5163), 562 states have call successors, (562), 43 states have call predecessors, (562), 47 states have return successors, (569), 562 states have call predecessors, (569), 561 states have call successors, (569) [2024-11-11 20:39:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3789 states to 3789 states and 6294 transitions. [2024-11-11 20:39:10,479 INFO L78 Accepts]: Start accepts. Automaton has 3789 states and 6294 transitions. Word has length 180 [2024-11-11 20:39:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:10,482 INFO L471 AbstractCegarLoop]: Abstraction has 3789 states and 6294 transitions. [2024-11-11 20:39:10,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3789 states and 6294 transitions. [2024-11-11 20:39:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-11 20:39:10,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:10,501 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:10,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:39:10,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:10,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:10,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1294703608, now seen corresponding path program 1 times [2024-11-11 20:39:10,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:10,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978349438] [2024-11-11 20:39:10,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:10,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:39:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:39:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-11 20:39:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 20:39:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-11 20:39:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-11 20:39:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:10,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:10,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978349438] [2024-11-11 20:39:10,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978349438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:10,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:10,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124893341] [2024-11-11 20:39:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:10,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:10,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:10,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:10,665 INFO L87 Difference]: Start difference. First operand 3789 states and 6294 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:12,336 INFO L93 Difference]: Finished difference Result 9114 states and 15280 transitions. [2024-11-11 20:39:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:12,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 181 [2024-11-11 20:39:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:12,365 INFO L225 Difference]: With dead ends: 9114 [2024-11-11 20:39:12,365 INFO L226 Difference]: Without dead ends: 5943 [2024-11-11 20:39:12,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:12,375 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1526 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 638 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 2394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 638 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:12,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 1229 Invalid, 2394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [638 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:39:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2024-11-11 20:39:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 5803. [2024-11-11 20:39:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5803 states, 4948 states have (on average 1.6321746160064672) internal successors, (8076), 5077 states have internal predecessors, (8076), 807 states have call successors, (807), 43 states have call predecessors, (807), 47 states have return successors, (814), 807 states have call predecessors, (814), 806 states have call successors, (814) [2024-11-11 20:39:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5803 states to 5803 states and 9697 transitions. [2024-11-11 20:39:12,605 INFO L78 Accepts]: Start accepts. Automaton has 5803 states and 9697 transitions. Word has length 181 [2024-11-11 20:39:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:12,606 INFO L471 AbstractCegarLoop]: Abstraction has 5803 states and 9697 transitions. [2024-11-11 20:39:12,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5803 states and 9697 transitions. [2024-11-11 20:39:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-11 20:39:12,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:12,637 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:12,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:39:12,637 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:12,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1589954433, now seen corresponding path program 1 times [2024-11-11 20:39:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925200112] [2024-11-11 20:39:12,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:39:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:39:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-11 20:39:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-11 20:39:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 20:39:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-11 20:39:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925200112] [2024-11-11 20:39:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925200112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:12,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:12,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897429750] [2024-11-11 20:39:12,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:12,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:12,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:12,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:12,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:12,770 INFO L87 Difference]: Start difference. First operand 5803 states and 9697 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:14,399 INFO L93 Difference]: Finished difference Result 14107 states and 23775 transitions. [2024-11-11 20:39:14,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:14,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 182 [2024-11-11 20:39:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:14,438 INFO L225 Difference]: With dead ends: 14107 [2024-11-11 20:39:14,439 INFO L226 Difference]: Without dead ends: 9318 [2024-11-11 20:39:14,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:14,457 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 1542 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:14,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 1261 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:39:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9318 states. [2024-11-11 20:39:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9318 to 9178. [2024-11-11 20:39:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9178 states, 7830 states have (on average 1.6339719029374202) internal successors, (12794), 8037 states have internal predecessors, (12794), 1300 states have call successors, (1300), 43 states have call predecessors, (1300), 47 states have return successors, (1307), 1300 states have call predecessors, (1307), 1299 states have call successors, (1307) [2024-11-11 20:39:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9178 states to 9178 states and 15401 transitions. [2024-11-11 20:39:14,824 INFO L78 Accepts]: Start accepts. Automaton has 9178 states and 15401 transitions. Word has length 182 [2024-11-11 20:39:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:14,827 INFO L471 AbstractCegarLoop]: Abstraction has 9178 states and 15401 transitions. [2024-11-11 20:39:14,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 9178 states and 15401 transitions. [2024-11-11 20:39:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-11 20:39:14,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:14,866 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:14,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:39:14,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1911332220, now seen corresponding path program 1 times [2024-11-11 20:39:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:14,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664173659] [2024-11-11 20:39:14,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:39:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:15,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:39:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:15,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 20:39:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 20:39:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-11 20:39:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-11 20:39:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:15,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:15,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664173659] [2024-11-11 20:39:15,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664173659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:15,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:15,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869513858] [2024-11-11 20:39:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:15,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:15,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:15,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:15,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:15,019 INFO L87 Difference]: Start difference. First operand 9178 states and 15401 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:16,729 INFO L93 Difference]: Finished difference Result 23060 states and 39002 transitions. [2024-11-11 20:39:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:16,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 183 [2024-11-11 20:39:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:16,848 INFO L225 Difference]: With dead ends: 23060 [2024-11-11 20:39:16,849 INFO L226 Difference]: Without dead ends: 15392 [2024-11-11 20:39:16,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:16,873 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 1515 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:16,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 1272 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [634 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:39:16,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15392 states. [2024-11-11 20:39:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15392 to 15252. [2024-11-11 20:39:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15252 states, 13082 states have (on average 1.6372114355603118) internal successors, (21418), 13433 states have internal predecessors, (21418), 2122 states have call successors, (2122), 43 states have call predecessors, (2122), 47 states have return successors, (2129), 2122 states have call predecessors, (2129), 2121 states have call successors, (2129) [2024-11-11 20:39:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15252 states to 15252 states and 25669 transitions. [2024-11-11 20:39:17,441 INFO L78 Accepts]: Start accepts. Automaton has 15252 states and 25669 transitions. Word has length 183 [2024-11-11 20:39:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:17,442 INFO L471 AbstractCegarLoop]: Abstraction has 15252 states and 25669 transitions. [2024-11-11 20:39:17,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 15252 states and 25669 transitions. [2024-11-11 20:39:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-11 20:39:17,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:17,603 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:17,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:39:17,604 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:17,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash -29705845, now seen corresponding path program 1 times [2024-11-11 20:39:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:17,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213822237] [2024-11-11 20:39:17,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:17,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:39:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:39:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-11 20:39:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-11 20:39:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-11 20:39:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-11 20:39:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:17,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213822237] [2024-11-11 20:39:17,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213822237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:17,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:17,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374384089] [2024-11-11 20:39:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:17,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:17,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:17,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:17,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:17,775 INFO L87 Difference]: Start difference. First operand 15252 states and 25669 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:19,593 INFO L93 Difference]: Finished difference Result 36869 states and 62014 transitions. [2024-11-11 20:39:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:19,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2024-11-11 20:39:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:19,680 INFO L225 Difference]: With dead ends: 36869 [2024-11-11 20:39:19,680 INFO L226 Difference]: Without dead ends: 24261 [2024-11-11 20:39:19,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:19,712 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1526 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:19,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 1205 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:39:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24261 states. [2024-11-11 20:39:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24261 to 24121. [2024-11-11 20:39:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24121 states, 20748 states have (on average 1.619770580296896) internal successors, (33607), 21373 states have internal predecessors, (33607), 3325 states have call successors, (3325), 43 states have call predecessors, (3325), 47 states have return successors, (3332), 3325 states have call predecessors, (3332), 3324 states have call successors, (3332) [2024-11-11 20:39:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24121 states to 24121 states and 40264 transitions. [2024-11-11 20:39:20,685 INFO L78 Accepts]: Start accepts. Automaton has 24121 states and 40264 transitions. Word has length 184 [2024-11-11 20:39:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:20,686 INFO L471 AbstractCegarLoop]: Abstraction has 24121 states and 40264 transitions. [2024-11-11 20:39:20,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 24121 states and 40264 transitions. [2024-11-11 20:39:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-11 20:39:20,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:20,780 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:20,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:39:20,780 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:20,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1806218284, now seen corresponding path program 1 times [2024-11-11 20:39:20,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:20,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467283245] [2024-11-11 20:39:20,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:39:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:39:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 20:39:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-11 20:39:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-11 20:39:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-11 20:39:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:20,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:20,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467283245] [2024-11-11 20:39:20,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467283245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:20,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:20,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997646858] [2024-11-11 20:39:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:20,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:20,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:20,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:20,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:20,964 INFO L87 Difference]: Start difference. First operand 24121 states and 40264 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:23,453 INFO L93 Difference]: Finished difference Result 63722 states and 106674 transitions. [2024-11-11 20:39:23,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:23,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 185 [2024-11-11 20:39:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:23,612 INFO L225 Difference]: With dead ends: 63722 [2024-11-11 20:39:23,612 INFO L226 Difference]: Without dead ends: 43057 [2024-11-11 20:39:23,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:23,664 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 1535 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:23,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 1245 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 20:39:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43057 states. [2024-11-11 20:39:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43057 to 42917. [2024-11-11 20:39:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42917 states, 37094 states have (on average 1.6154634172642477) internal successors, (59924), 37985 states have internal predecessors, (59924), 5775 states have call successors, (5775), 43 states have call predecessors, (5775), 47 states have return successors, (5782), 5775 states have call predecessors, (5782), 5774 states have call successors, (5782) [2024-11-11 20:39:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42917 states to 42917 states and 71481 transitions. [2024-11-11 20:39:25,362 INFO L78 Accepts]: Start accepts. Automaton has 42917 states and 71481 transitions. Word has length 185 [2024-11-11 20:39:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:25,363 INFO L471 AbstractCegarLoop]: Abstraction has 42917 states and 71481 transitions. [2024-11-11 20:39:25,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42917 states and 71481 transitions. [2024-11-11 20:39:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-11 20:39:25,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:25,471 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:25,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:39:25,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:25,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1537065992, now seen corresponding path program 1 times [2024-11-11 20:39:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:25,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50183029] [2024-11-11 20:39:25,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:25,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:39:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:39:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 20:39:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-11 20:39:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 20:39:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-11 20:39:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:25,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:25,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50183029] [2024-11-11 20:39:25,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50183029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:25,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:25,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:25,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576909784] [2024-11-11 20:39:25,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:25,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:25,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:25,668 INFO L87 Difference]: Start difference. First operand 42917 states and 71481 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:28,707 INFO L93 Difference]: Finished difference Result 116384 states and 194556 transitions. [2024-11-11 20:39:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:28,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 186 [2024-11-11 20:39:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:29,011 INFO L225 Difference]: With dead ends: 116384 [2024-11-11 20:39:29,011 INFO L226 Difference]: Without dead ends: 78099 [2024-11-11 20:39:29,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:29,288 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1518 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 643 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:29,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 1248 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [643 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 20:39:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78099 states. [2024-11-11 20:39:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78099 to 77959. [2024-11-11 20:39:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77959 states, 67623 states have (on average 1.6143176138296143) internal successors, (109165), 69303 states have internal predecessors, (109165), 10288 states have call successors, (10288), 43 states have call predecessors, (10288), 47 states have return successors, (10295), 10288 states have call predecessors, (10295), 10287 states have call successors, (10295) [2024-11-11 20:39:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77959 states to 77959 states and 129748 transitions. [2024-11-11 20:39:31,587 INFO L78 Accepts]: Start accepts. Automaton has 77959 states and 129748 transitions. Word has length 186 [2024-11-11 20:39:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:31,589 INFO L471 AbstractCegarLoop]: Abstraction has 77959 states and 129748 transitions. [2024-11-11 20:39:31,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 77959 states and 129748 transitions. [2024-11-11 20:39:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-11 20:39:32,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:32,241 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:32,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:39:32,241 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:32,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:32,242 INFO L85 PathProgramCache]: Analyzing trace with hash -66163713, now seen corresponding path program 1 times [2024-11-11 20:39:32,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:32,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356004696] [2024-11-11 20:39:32,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:32,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:39:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:39:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 20:39:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-11 20:39:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-11 20:39:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-11 20:39:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-11 20:39:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356004696] [2024-11-11 20:39:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356004696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:32,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580004296] [2024-11-11 20:39:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:32,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:32,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:32,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:32,437 INFO L87 Difference]: Start difference. First operand 77959 states and 129748 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:36,338 INFO L93 Difference]: Finished difference Result 145849 states and 242711 transitions. [2024-11-11 20:39:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:39:36,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 187 [2024-11-11 20:39:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:36,927 INFO L225 Difference]: With dead ends: 145849 [2024-11-11 20:39:36,927 INFO L226 Difference]: Without dead ends: 145524 [2024-11-11 20:39:36,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:36,983 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1510 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:36,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1269 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:39:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145524 states. [2024-11-11 20:39:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145524 to 145384. [2024-11-11 20:39:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145384 states, 126680 states have (on average 1.6072544995263656) internal successors, (203607), 128883 states have internal predecessors, (203607), 18656 states have call successors, (18656), 43 states have call predecessors, (18656), 47 states have return successors, (18663), 18656 states have call predecessors, (18663), 18655 states have call successors, (18663) [2024-11-11 20:39:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145384 states to 145384 states and 240926 transitions. [2024-11-11 20:39:41,733 INFO L78 Accepts]: Start accepts. Automaton has 145384 states and 240926 transitions. Word has length 187 [2024-11-11 20:39:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:41,734 INFO L471 AbstractCegarLoop]: Abstraction has 145384 states and 240926 transitions. [2024-11-11 20:39:41,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-11 20:39:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 145384 states and 240926 transitions. [2024-11-11 20:39:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-11 20:39:42,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:42,572 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:42,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:39:42,572 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:42,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 215209295, now seen corresponding path program 1 times [2024-11-11 20:39:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124790121] [2024-11-11 20:39:42,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:39:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:39:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:39:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:39:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:39:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:39:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:39:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:39:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:39:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:39:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-11 20:39:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 20:39:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-11 20:39:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 20:39:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:39:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-11 20:39:43,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:43,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124790121] [2024-11-11 20:39:43,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124790121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:39:43,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242135508] [2024-11-11 20:39:43,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:43,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:43,646 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:39:43,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:39:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:44,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-11 20:39:44,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:39:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-11 20:39:44,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:39:44,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242135508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:44,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:39:44,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [28] total 46 [2024-11-11 20:39:44,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827785196] [2024-11-11 20:39:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:44,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 20:39:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 20:39:44,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1960, Unknown=0, NotChecked=0, Total=2070 [2024-11-11 20:39:44,899 INFO L87 Difference]: Start difference. First operand 145384 states and 240926 transitions. Second operand has 20 states, 18 states have (on average 6.722222222222222) internal successors, (121), 15 states have internal predecessors, (121), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2024-11-11 20:39:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:48,678 INFO L93 Difference]: Finished difference Result 146170 states and 242073 transitions. [2024-11-11 20:39:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-11 20:39:48,679 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.722222222222222) internal successors, (121), 15 states have internal predecessors, (121), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 188 [2024-11-11 20:39:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:49,358 INFO L225 Difference]: With dead ends: 146170 [2024-11-11 20:39:49,359 INFO L226 Difference]: Without dead ends: 145853 [2024-11-11 20:39:49,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=382, Invalid=4874, Unknown=0, NotChecked=0, Total=5256 [2024-11-11 20:39:49,412 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 1594 mSDsluCounter, 15612 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 16546 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:49,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 16546 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:39:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145853 states.