./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.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 ca4739abfecd00b8d2b799ccc2617c6e4b4e221f88b8a7e722070835771a8404 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:54:50,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:54:50,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:54:50,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:54:50,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:54:50,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:54:50,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:54:50,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:54:50,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:54:50,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:54:50,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:54:50,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:54:50,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:54:50,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:54:50,692 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:54:50,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:54:50,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:54:50,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:54:50,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:54:50,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:54:50,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:54:50,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:54:50,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:54:50,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:54:50,697 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:54:50,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:54:50,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:54:50,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:54:50,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:54:50,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:54:50,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:54:50,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:54:50,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:54:50,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:54:50,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:54:50,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:54:50,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:54:50,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:54:50,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:54:50,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:54:50,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:54:50,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:54:50,703 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 -> ca4739abfecd00b8d2b799ccc2617c6e4b4e221f88b8a7e722070835771a8404 [2024-10-14 02:54:50,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:54:51,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:54:51,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:54:51,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:54:51,014 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:54:51,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c [2024-10-14 02:54:52,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:54:52,849 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:54:52,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c [2024-10-14 02:54:52,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd34bf7b/96cffa8c42514598ac6e4fc9c421d7c1/FLAG7c8c91641 [2024-10-14 02:54:52,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd34bf7b/96cffa8c42514598ac6e4fc9c421d7c1 [2024-10-14 02:54:52,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:54:52,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:54:52,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:54:52,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:54:52,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:54:52,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:54:52" (1/1) ... [2024-10-14 02:54:52,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cd9465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:52, skipping insertion in model container [2024-10-14 02:54:52,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:54:52" (1/1) ... [2024-10-14 02:54:52,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:54:53,538 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c[64142,64155] [2024-10-14 02:54:53,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:54:53,561 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:54:53,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-10-14 02:54:53,573 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [66] [2024-10-14 02:54:53,573 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [108] [2024-10-14 02:54:53,573 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [489] [2024-10-14 02:54:53,574 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [855] [2024-10-14 02:54:53,574 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [992] [2024-10-14 02:54:53,574 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1217] [2024-10-14 02:54:53,574 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1255] [2024-10-14 02:54:53,575 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1537] [2024-10-14 02:54:53,575 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1934] [2024-10-14 02:54:53,575 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3001] [2024-10-14 02:54:53,664 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c[64142,64155] [2024-10-14 02:54:53,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:54:53,709 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:54:53,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53 WrapperNode [2024-10-14 02:54:53,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:54:53,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:54:53,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:54:53,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:54:53,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,820 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 61, calls inlined = 56, statements flattened = 1029 [2024-10-14 02:54:53,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:54:53,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:54:53,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:54:53,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:54:53,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,897 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-14 02:54:53,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:54:53,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:54:53,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:54:53,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:54:53,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (1/1) ... [2024-10-14 02:54:53,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:54:53,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:54:54,010 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-10-14 02:54:54,012 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-10-14 02:54:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-14 02:54:54,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-14 02:54:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-14 02:54:54,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-14 02:54:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-14 02:54:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-14 02:54:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-14 02:54:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-14 02:54:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-14 02:54:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-14 02:54:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-14 02:54:54,053 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-14 02:54:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-14 02:54:54,053 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-14 02:54:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-14 02:54:54,053 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-14 02:54:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-14 02:54:54,054 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-14 02:54:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-14 02:54:54,054 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-14 02:54:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-14 02:54:54,054 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-14 02:54:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-14 02:54:54,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-14 02:54:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:54:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-14 02:54:54,055 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-14 02:54:54,055 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-14 02:54:54,056 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-14 02:54:54,056 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-14 02:54:54,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-14 02:54:54,056 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-14 02:54:54,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-14 02:54:54,056 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-14 02:54:54,057 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-14 02:54:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-14 02:54:54,057 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-14 02:54:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-14 02:54:54,057 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-14 02:54:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-14 02:54:54,058 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-14 02:54:54,058 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-14 02:54:54,058 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-14 02:54:54,058 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-14 02:54:54,058 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-14 02:54:54,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:54:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:54:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:54:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:54:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-14 02:54:54,059 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-14 02:54:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:54:54,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:54:54,248 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:54:54,250 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:54:55,232 INFO L? ?]: Removed 476 outVars from TransFormulas that were not future-live. [2024-10-14 02:54:55,232 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:54:55,318 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:54:55,320 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:54:55,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:54:55 BoogieIcfgContainer [2024-10-14 02:54:55,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:54:55,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:54:55,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:54:55,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:54:55,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:54:52" (1/3) ... [2024-10-14 02:54:55,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431f66db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:54:55, skipping insertion in model container [2024-10-14 02:54:55,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:54:53" (2/3) ... [2024-10-14 02:54:55,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431f66db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:54:55, skipping insertion in model container [2024-10-14 02:54:55,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:54:55" (3/3) ... [2024-10-14 02:54:55,332 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product31.cil.c [2024-10-14 02:54:55,349 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:54:55,350 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:54:55,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:54:55,445 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;@74efe248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:54:55,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:54:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 338 states, 254 states have (on average 1.562992125984252) internal successors, (397), 258 states have internal predecessors, (397), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-14 02:54:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 02:54:55,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:54:55,478 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:54:55,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:54:55,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:54:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1921350872, now seen corresponding path program 1 times [2024-10-14 02:54:55,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:54:55,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166707733] [2024-10-14 02:54:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:54:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:54:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:54:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:54:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:54:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:54:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:54:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:54:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:54:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:54:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:54:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:54:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:54:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:54:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:54:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 02:54:56,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:54:56,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166707733] [2024-10-14 02:54:56,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166707733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:54:56,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637205741] [2024-10-14 02:54:56,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:54:56,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:54:56,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:54:56,324 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-10-14 02:54:56,326 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-10-14 02:54:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:56,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 02:54:56,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:54:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:54:56,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:54:56,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637205741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:54:56,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:54:56,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-14 02:54:56,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024613225] [2024-10-14 02:54:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:54:56,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:54:56,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:54:56,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:54:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:54:56,757 INFO L87 Difference]: Start difference. First operand has 338 states, 254 states have (on average 1.562992125984252) internal successors, (397), 258 states have internal predecessors, (397), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:54:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:54:56,841 INFO L93 Difference]: Finished difference Result 531 states and 793 transitions. [2024-10-14 02:54:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:54:56,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2024-10-14 02:54:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:54:56,863 INFO L225 Difference]: With dead ends: 531 [2024-10-14 02:54:56,863 INFO L226 Difference]: Without dead ends: 335 [2024-10-14 02:54:56,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:54:56,876 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:54:56,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:54:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-14 02:54:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2024-10-14 02:54:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 252 states have (on average 1.5476190476190477) internal successors, (390), 255 states have internal predecessors, (390), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-14 02:54:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 507 transitions. [2024-10-14 02:54:56,955 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 507 transitions. Word has length 95 [2024-10-14 02:54:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:54:56,959 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 507 transitions. [2024-10-14 02:54:56,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:54:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 507 transitions. [2024-10-14 02:54:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:54:56,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:54:56,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:54:56,988 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-10-14 02:54:57,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-14 02:54:57,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:54:57,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:54:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash -950275068, now seen corresponding path program 1 times [2024-10-14 02:54:57,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:54:57,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109874566] [2024-10-14 02:54:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:54:57,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:54:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:54:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:54:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:54:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:54:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:54:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:54:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:54:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:54:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 02:54:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:54:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:54:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:54:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:54:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 02:54:57,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:54:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109874566] [2024-10-14 02:54:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109874566] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:54:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015058294] [2024-10-14 02:54:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:54:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:54:57,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:54:57,500 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-10-14 02:54:57,505 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-10-14 02:54:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:57,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 02:54:57,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:54:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:54:57,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:54:57,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015058294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:54:57,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:54:57,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-14 02:54:57,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444772371] [2024-10-14 02:54:57,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:54:57,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:54:57,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:54:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:54:57,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:54:57,878 INFO L87 Difference]: Start difference. First operand 335 states and 507 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:54:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:54:57,957 INFO L93 Difference]: Finished difference Result 527 states and 780 transitions. [2024-10-14 02:54:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:54:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-10-14 02:54:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:54:57,966 INFO L225 Difference]: With dead ends: 527 [2024-10-14 02:54:57,966 INFO L226 Difference]: Without dead ends: 337 [2024-10-14 02:54:57,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:54:57,968 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 0 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:54:57,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 983 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:54:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-14 02:54:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-10-14 02:54:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 254 states have (on average 1.5433070866141732) internal successors, (392), 257 states have internal predecessors, (392), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-14 02:54:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 509 transitions. [2024-10-14 02:54:58,005 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 509 transitions. Word has length 96 [2024-10-14 02:54:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:54:58,006 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 509 transitions. [2024-10-14 02:54:58,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:54:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2024-10-14 02:54:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 02:54:58,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:54:58,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:54:58,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 02:54:58,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-14 02:54:58,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:54:58,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:54:58,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1736048719, now seen corresponding path program 1 times [2024-10-14 02:54:58,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:54:58,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82974766] [2024-10-14 02:54:58,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:54:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:54:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:54:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:54:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:54:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:54:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:54:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:54:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:54:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:54:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 02:54:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:54:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:54:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:54:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:54:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 02:54:58,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:54:58,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82974766] [2024-10-14 02:54:58,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82974766] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:54:58,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391584978] [2024-10-14 02:54:58,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:54:58,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:54:58,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:54:58,480 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-10-14 02:54:58,482 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-10-14 02:54:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:58,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 02:54:58,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:54:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:54:58,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:54:58,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391584978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:54:58,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:54:58,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-14 02:54:58,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378728882] [2024-10-14 02:54:58,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:54:58,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:54:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:54:58,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:54:58,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:54:58,801 INFO L87 Difference]: Start difference. First operand 337 states and 509 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:54:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:54:58,896 INFO L93 Difference]: Finished difference Result 704 states and 1077 transitions. [2024-10-14 02:54:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:54:58,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2024-10-14 02:54:58,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:54:58,900 INFO L225 Difference]: With dead ends: 704 [2024-10-14 02:54:58,901 INFO L226 Difference]: Without dead ends: 389 [2024-10-14 02:54:58,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:54:58,905 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 102 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:54:58,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 945 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:54:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-14 02:54:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 384. [2024-10-14 02:54:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 290 states have (on average 1.5586206896551724) internal successors, (452), 293 states have internal predecessors, (452), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-14 02:54:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 591 transitions. [2024-10-14 02:54:58,928 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 591 transitions. Word has length 101 [2024-10-14 02:54:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:54:58,929 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 591 transitions. [2024-10-14 02:54:58,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:54:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 591 transitions. [2024-10-14 02:54:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 02:54:58,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:54:58,932 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:54:58,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 02:54:59,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:54:59,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:54:59,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:54:59,134 INFO L85 PathProgramCache]: Analyzing trace with hash -969168339, now seen corresponding path program 1 times [2024-10-14 02:54:59,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:54:59,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828989721] [2024-10-14 02:54:59,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:54:59,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:54:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:54:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:54:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:54:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:54:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:54:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:54:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:54:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:54:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:54:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:54:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:54:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:54:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:54:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 02:54:59,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:54:59,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828989721] [2024-10-14 02:54:59,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828989721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:54:59,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108300397] [2024-10-14 02:54:59,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:54:59,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:54:59,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:54:59,382 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-10-14 02:54:59,383 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-10-14 02:54:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:54:59,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 02:54:59,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:54:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 02:54:59,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:54:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108300397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:54:59,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:54:59,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-14 02:54:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277261335] [2024-10-14 02:54:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:54:59,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:54:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:54:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:54:59,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:54:59,727 INFO L87 Difference]: Start difference. First operand 384 states and 591 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:54:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:54:59,825 INFO L93 Difference]: Finished difference Result 763 states and 1176 transitions. [2024-10-14 02:54:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:54:59,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 102 [2024-10-14 02:54:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:54:59,829 INFO L225 Difference]: With dead ends: 763 [2024-10-14 02:54:59,829 INFO L226 Difference]: Without dead ends: 386 [2024-10-14 02:54:59,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:54:59,831 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 2 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:54:59,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1925 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:54:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-14 02:54:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-10-14 02:54:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 291 states have (on average 1.556701030927835) internal successors, (453), 295 states have internal predecessors, (453), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2024-10-14 02:54:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 594 transitions. [2024-10-14 02:54:59,852 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 594 transitions. Word has length 102 [2024-10-14 02:54:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:54:59,852 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 594 transitions. [2024-10-14 02:54:59,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:54:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 594 transitions. [2024-10-14 02:54:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 02:54:59,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:54:59,855 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:54:59,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 02:55:00,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:55:00,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:00,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1952636339, now seen corresponding path program 1 times [2024-10-14 02:55:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:00,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972845730] [2024-10-14 02:55:00,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:00,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:55:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:55:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:55:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:55:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:55:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:55:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:55:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:55:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:55:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 02:55:00,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:00,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972845730] [2024-10-14 02:55:00,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972845730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:55:00,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241394365] [2024-10-14 02:55:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:00,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:55:00,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:55:00,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:55:00,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 02:55:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:00,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 02:55:00,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:55:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 02:55:00,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:55:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241394365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:55:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-14 02:55:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977816597] [2024-10-14 02:55:00,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:00,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:55:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:00,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:55:00,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:55:00,692 INFO L87 Difference]: Start difference. First operand 386 states and 594 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:55:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:00,795 INFO L93 Difference]: Finished difference Result 765 states and 1181 transitions. [2024-10-14 02:55:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:55:00,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 103 [2024-10-14 02:55:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:00,799 INFO L225 Difference]: With dead ends: 765 [2024-10-14 02:55:00,799 INFO L226 Difference]: Without dead ends: 388 [2024-10-14 02:55:00,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:55:00,802 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 2 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:00,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1911 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:55:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-14 02:55:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-10-14 02:55:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 292 states have (on average 1.5547945205479452) internal successors, (454), 297 states have internal predecessors, (454), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2024-10-14 02:55:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 600 transitions. [2024-10-14 02:55:00,828 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 600 transitions. Word has length 103 [2024-10-14 02:55:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:00,828 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 600 transitions. [2024-10-14 02:55:00,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:55:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 600 transitions. [2024-10-14 02:55:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 02:55:00,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:00,832 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:00,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 02:55:01,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:55:01,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:01,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:01,034 INFO L85 PathProgramCache]: Analyzing trace with hash -125464356, now seen corresponding path program 1 times [2024-10-14 02:55:01,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:01,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768918530] [2024-10-14 02:55:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:55:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:55:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 02:55:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:55:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:55:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 02:55:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:55:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 02:55:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 02:55:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:01,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768918530] [2024-10-14 02:55:01,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768918530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:01,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:55:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700444989] [2024-10-14 02:55:01,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:01,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:55:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:55:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:55:01,278 INFO L87 Difference]: Start difference. First operand 388 states and 600 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:55:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:03,629 INFO L93 Difference]: Finished difference Result 901 states and 1406 transitions. [2024-10-14 02:55:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:55:03,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 104 [2024-10-14 02:55:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:03,634 INFO L225 Difference]: With dead ends: 901 [2024-10-14 02:55:03,634 INFO L226 Difference]: Without dead ends: 532 [2024-10-14 02:55:03,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 02:55:03,637 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1102 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:03,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 968 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 02:55:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-10-14 02:55:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 388. [2024-10-14 02:55:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 292 states have (on average 1.5547945205479452) internal successors, (454), 297 states have internal predecessors, (454), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2024-10-14 02:55:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 599 transitions. [2024-10-14 02:55:03,686 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 599 transitions. Word has length 104 [2024-10-14 02:55:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:03,687 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 599 transitions. [2024-10-14 02:55:03,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:55:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 599 transitions. [2024-10-14 02:55:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 02:55:03,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:03,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:03,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:55:03,692 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:03,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash 711121412, now seen corresponding path program 2 times [2024-10-14 02:55:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:03,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200707109] [2024-10-14 02:55:03,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:55:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:55:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 02:55:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 02:55:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:55:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:55:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:55:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:55:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 02:55:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200707109] [2024-10-14 02:55:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200707109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:03,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:03,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:55:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950227468] [2024-10-14 02:55:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:03,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:55:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:03,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:55:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:55:03,937 INFO L87 Difference]: Start difference. First operand 388 states and 599 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:55:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:06,049 INFO L93 Difference]: Finished difference Result 903 states and 1409 transitions. [2024-10-14 02:55:06,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:55:06,050 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2024-10-14 02:55:06,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:06,054 INFO L225 Difference]: With dead ends: 903 [2024-10-14 02:55:06,055 INFO L226 Difference]: Without dead ends: 534 [2024-10-14 02:55:06,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 02:55:06,057 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1098 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:06,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 968 Invalid, 3125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 02:55:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-14 02:55:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 390. [2024-10-14 02:55:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 293 states have (on average 1.552901023890785) internal successors, (455), 299 states have internal predecessors, (455), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (77), 69 states have call predecessors, (77), 69 states have call successors, (77) [2024-10-14 02:55:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 602 transitions. [2024-10-14 02:55:06,105 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 602 transitions. Word has length 105 [2024-10-14 02:55:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:06,106 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 602 transitions. [2024-10-14 02:55:06,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:55:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 602 transitions. [2024-10-14 02:55:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 02:55:06,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:06,108 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:06,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:55:06,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:06,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1201433737, now seen corresponding path program 1 times [2024-10-14 02:55:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:06,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684428200] [2024-10-14 02:55:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:55:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 02:55:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 02:55:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:55:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:55:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:55:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 02:55:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 02:55:06,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684428200] [2024-10-14 02:55:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684428200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:06,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 02:55:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55835569] [2024-10-14 02:55:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:06,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:55:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:06,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:55:06,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:55:06,363 INFO L87 Difference]: Start difference. First operand 390 states and 602 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 02:55:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:09,344 INFO L93 Difference]: Finished difference Result 901 states and 1404 transitions. [2024-10-14 02:55:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:55:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 106 [2024-10-14 02:55:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:09,350 INFO L225 Difference]: With dead ends: 901 [2024-10-14 02:55:09,350 INFO L226 Difference]: Without dead ends: 534 [2024-10-14 02:55:09,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-14 02:55:09,355 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1102 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 4552 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 4942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 4552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:09,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1343 Invalid, 4942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 4552 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:55:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-14 02:55:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 390. [2024-10-14 02:55:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 293 states have (on average 1.552901023890785) internal successors, (455), 299 states have internal predecessors, (455), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2024-10-14 02:55:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 601 transitions. [2024-10-14 02:55:09,406 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 601 transitions. Word has length 106 [2024-10-14 02:55:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:09,408 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 601 transitions. [2024-10-14 02:55:09,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 02:55:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 601 transitions. [2024-10-14 02:55:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 02:55:09,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:09,410 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:09,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:55:09,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:09,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2061833220, now seen corresponding path program 2 times [2024-10-14 02:55:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:09,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746305479] [2024-10-14 02:55:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:55:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 02:55:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 02:55:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:55:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:55:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:55:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 02:55:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 02:55:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746305479] [2024-10-14 02:55:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746305479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:09,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 02:55:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876700900] [2024-10-14 02:55:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:09,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:55:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:55:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:55:09,668 INFO L87 Difference]: Start difference. First operand 390 states and 601 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 02:55:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:12,433 INFO L93 Difference]: Finished difference Result 903 states and 1410 transitions. [2024-10-14 02:55:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:55:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 107 [2024-10-14 02:55:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:12,438 INFO L225 Difference]: With dead ends: 903 [2024-10-14 02:55:12,438 INFO L226 Difference]: Without dead ends: 536 [2024-10-14 02:55:12,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-14 02:55:12,443 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1098 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 4589 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 4975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 4589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:12,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1344 Invalid, 4975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 4589 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:55:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-14 02:55:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 392. [2024-10-14 02:55:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 294 states have (on average 1.5510204081632653) internal successors, (456), 301 states have internal predecessors, (456), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 69 states have call predecessors, (81), 69 states have call successors, (81) [2024-10-14 02:55:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 607 transitions. [2024-10-14 02:55:12,480 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 607 transitions. Word has length 107 [2024-10-14 02:55:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:12,481 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 607 transitions. [2024-10-14 02:55:12,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 02:55:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 607 transitions. [2024-10-14 02:55:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 02:55:12,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:12,484 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:12,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:55:12,485 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:12,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:12,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1567920626, now seen corresponding path program 1 times [2024-10-14 02:55:12,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:12,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294199045] [2024-10-14 02:55:12,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:55:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 02:55:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:55:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:55:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:55:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:55:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 02:55:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:12,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:12,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294199045] [2024-10-14 02:55:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294199045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:55:12,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957881285] [2024-10-14 02:55:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:12,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:55:12,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:55:12,660 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:55:12,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 02:55:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:12,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 02:55:12,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:55:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:12,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:55:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:13,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957881285] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:55:13,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:55:13,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-14 02:55:13,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355089135] [2024-10-14 02:55:13,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:55:13,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:55:13,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:13,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:55:13,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:55:13,064 INFO L87 Difference]: Start difference. First operand 392 states and 607 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 02:55:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:14,913 INFO L93 Difference]: Finished difference Result 1056 states and 1722 transitions. [2024-10-14 02:55:14,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:55:14,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 108 [2024-10-14 02:55:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:14,919 INFO L225 Difference]: With dead ends: 1056 [2024-10-14 02:55:14,920 INFO L226 Difference]: Without dead ends: 866 [2024-10-14 02:55:14,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-14 02:55:14,922 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1448 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:14,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1375 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 02:55:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-10-14 02:55:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 707. [2024-10-14 02:55:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 545 states have (on average 1.61651376146789) internal successors, (881), 552 states have internal predecessors, (881), 134 states have call successors, (134), 23 states have call predecessors, (134), 27 states have return successors, (155), 133 states have call predecessors, (155), 133 states have call successors, (155) [2024-10-14 02:55:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1170 transitions. [2024-10-14 02:55:14,968 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1170 transitions. Word has length 108 [2024-10-14 02:55:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:14,969 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1170 transitions. [2024-10-14 02:55:14,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 02:55:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1170 transitions. [2024-10-14 02:55:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 02:55:14,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:14,973 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:14,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 02:55:15,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:55:15,174 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:15,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:15,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1058713771, now seen corresponding path program 1 times [2024-10-14 02:55:15,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:15,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881593413] [2024-10-14 02:55:15,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:15,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 02:55:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 02:55:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:55:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:55:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:55:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 02:55:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 02:55:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:15,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:15,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881593413] [2024-10-14 02:55:15,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881593413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:15,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:15,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:55:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290910431] [2024-10-14 02:55:15,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:15,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:55:15,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:15,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:55:15,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:55:15,289 INFO L87 Difference]: Start difference. First operand 707 states and 1170 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:16,898 INFO L93 Difference]: Finished difference Result 1815 states and 3071 transitions. [2024-10-14 02:55:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:55:16,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-10-14 02:55:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:16,906 INFO L225 Difference]: With dead ends: 1815 [2024-10-14 02:55:16,907 INFO L226 Difference]: Without dead ends: 1168 [2024-10-14 02:55:16,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:55:16,910 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1197 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:16,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 756 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 02:55:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-10-14 02:55:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1019. [2024-10-14 02:55:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 793 states have (on average 1.630517023959647) internal successors, (1293), 800 states have internal predecessors, (1293), 198 states have call successors, (198), 23 states have call predecessors, (198), 27 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2024-10-14 02:55:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1720 transitions. [2024-10-14 02:55:16,967 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1720 transitions. Word has length 114 [2024-10-14 02:55:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:16,967 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1720 transitions. [2024-10-14 02:55:16,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1720 transitions. [2024-10-14 02:55:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 02:55:16,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:16,972 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:16,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:55:16,973 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:16,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:16,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1227501226, now seen corresponding path program 1 times [2024-10-14 02:55:16,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:16,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196032735] [2024-10-14 02:55:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:16,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:55:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 02:55:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:55:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:55:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:55:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 02:55:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 02:55:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:17,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196032735] [2024-10-14 02:55:17,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196032735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:17,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:17,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:55:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894226806] [2024-10-14 02:55:17,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:17,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:55:17,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:17,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:55:17,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:55:17,085 INFO L87 Difference]: Start difference. First operand 1019 states and 1720 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:18,641 INFO L93 Difference]: Finished difference Result 2564 states and 4389 transitions. [2024-10-14 02:55:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:55:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-14 02:55:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:18,650 INFO L225 Difference]: With dead ends: 2564 [2024-10-14 02:55:18,650 INFO L226 Difference]: Without dead ends: 1655 [2024-10-14 02:55:18,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:55:18,655 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1195 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:18,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 716 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 02:55:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-10-14 02:55:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1506. [2024-10-14 02:55:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1185 states have (on average 1.639662447257384) internal successors, (1943), 1192 states have internal predecessors, (1943), 293 states have call successors, (293), 23 states have call predecessors, (293), 27 states have return successors, (324), 292 states have call predecessors, (324), 292 states have call successors, (324) [2024-10-14 02:55:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2560 transitions. [2024-10-14 02:55:18,734 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2560 transitions. Word has length 115 [2024-10-14 02:55:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:18,735 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2560 transitions. [2024-10-14 02:55:18,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2560 transitions. [2024-10-14 02:55:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 02:55:18,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:18,742 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:18,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:55:18,742 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:18,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1516541741, now seen corresponding path program 1 times [2024-10-14 02:55:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:18,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749394609] [2024-10-14 02:55:18,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:18,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:55:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:55:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:55:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 02:55:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:55:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:55:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 02:55:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:18,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:18,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749394609] [2024-10-14 02:55:18,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749394609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:18,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:18,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:55:18,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691497492] [2024-10-14 02:55:18,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:18,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:55:18,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:18,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:55:18,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:55:18,902 INFO L87 Difference]: Start difference. First operand 1506 states and 2560 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:20,280 INFO L93 Difference]: Finished difference Result 3666 states and 6348 transitions. [2024-10-14 02:55:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:55:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-14 02:55:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:20,294 INFO L225 Difference]: With dead ends: 3666 [2024-10-14 02:55:20,295 INFO L226 Difference]: Without dead ends: 2390 [2024-10-14 02:55:20,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:55:20,301 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1193 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:20,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 708 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 02:55:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2024-10-14 02:55:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2241. [2024-10-14 02:55:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1797 states have (on average 1.6471897607122983) internal successors, (2960), 1804 states have internal predecessors, (2960), 416 states have call successors, (416), 23 states have call predecessors, (416), 27 states have return successors, (463), 415 states have call predecessors, (463), 415 states have call successors, (463) [2024-10-14 02:55:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3839 transitions. [2024-10-14 02:55:20,428 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3839 transitions. Word has length 116 [2024-10-14 02:55:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:20,428 INFO L471 AbstractCegarLoop]: Abstraction has 2241 states and 3839 transitions. [2024-10-14 02:55:20,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3839 transitions. [2024-10-14 02:55:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 02:55:20,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:20,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:20,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:55:20,438 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:20,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:20,438 INFO L85 PathProgramCache]: Analyzing trace with hash 209029513, now seen corresponding path program 1 times [2024-10-14 02:55:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594255348] [2024-10-14 02:55:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:20,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:55:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:55:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:55:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:55:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:55:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 02:55:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 02:55:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:20,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594255348] [2024-10-14 02:55:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594255348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:55:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201161253] [2024-10-14 02:55:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:20,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:55:20,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:55:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:55:20,539 INFO L87 Difference]: Start difference. First operand 2241 states and 3839 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:22,099 INFO L93 Difference]: Finished difference Result 5376 states and 9398 transitions. [2024-10-14 02:55:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:55:22,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-14 02:55:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:22,120 INFO L225 Difference]: With dead ends: 5376 [2024-10-14 02:55:22,120 INFO L226 Difference]: Without dead ends: 3562 [2024-10-14 02:55:22,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:55:22,128 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1191 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:22,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 708 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 02:55:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2024-10-14 02:55:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3413. [2024-10-14 02:55:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3413 states, 2790 states have (on average 1.6523297491039426) internal successors, (4610), 2797 states have internal predecessors, (4610), 595 states have call successors, (595), 23 states have call predecessors, (595), 27 states have return successors, (668), 594 states have call predecessors, (668), 594 states have call successors, (668) [2024-10-14 02:55:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 5873 transitions. [2024-10-14 02:55:22,301 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 5873 transitions. Word has length 117 [2024-10-14 02:55:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:22,302 INFO L471 AbstractCegarLoop]: Abstraction has 3413 states and 5873 transitions. [2024-10-14 02:55:22,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 5873 transitions. [2024-10-14 02:55:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 02:55:22,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:22,314 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:22,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:55:22,315 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:22,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1532009975, now seen corresponding path program 1 times [2024-10-14 02:55:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:22,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190238208] [2024-10-14 02:55:22,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 02:55:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:55:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 02:55:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:55:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:55:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 02:55:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 02:55:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:22,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:22,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190238208] [2024-10-14 02:55:22,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190238208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:22,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:22,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:55:22,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11492628] [2024-10-14 02:55:22,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:22,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:55:22,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:22,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:55:22,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:55:22,437 INFO L87 Difference]: Start difference. First operand 3413 states and 5873 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:23,864 INFO L93 Difference]: Finished difference Result 8231 states and 14452 transitions. [2024-10-14 02:55:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:55:23,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-10-14 02:55:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:23,901 INFO L225 Difference]: With dead ends: 8231 [2024-10-14 02:55:23,901 INFO L226 Difference]: Without dead ends: 5532 [2024-10-14 02:55:23,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:55:23,916 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 1189 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:23,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 737 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 02:55:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2024-10-14 02:55:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5383. [2024-10-14 02:55:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5383 states, 4384 states have (on average 1.6425638686131387) internal successors, (7201), 4391 states have internal predecessors, (7201), 971 states have call successors, (971), 23 states have call predecessors, (971), 27 states have return successors, (1088), 970 states have call predecessors, (1088), 970 states have call successors, (1088) [2024-10-14 02:55:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 9260 transitions. [2024-10-14 02:55:24,223 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 9260 transitions. Word has length 118 [2024-10-14 02:55:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:24,223 INFO L471 AbstractCegarLoop]: Abstraction has 5383 states and 9260 transitions. [2024-10-14 02:55:24,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:24,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 9260 transitions. [2024-10-14 02:55:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 02:55:24,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:24,248 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:24,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 02:55:24,249 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:24,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1118331803, now seen corresponding path program 1 times [2024-10-14 02:55:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217000370] [2024-10-14 02:55:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 02:55:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:55:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:55:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:55:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:55:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 02:55:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 02:55:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:24,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217000370] [2024-10-14 02:55:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217000370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:24,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:55:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285399671] [2024-10-14 02:55:24,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:24,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:55:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:55:24,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:55:24,378 INFO L87 Difference]: Start difference. First operand 5383 states and 9260 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:25,799 INFO L93 Difference]: Finished difference Result 13368 states and 23473 transitions. [2024-10-14 02:55:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:55:25,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-10-14 02:55:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:25,850 INFO L225 Difference]: With dead ends: 13368 [2024-10-14 02:55:25,850 INFO L226 Difference]: Without dead ends: 9065 [2024-10-14 02:55:25,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:55:25,870 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1187 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:25,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 709 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 02:55:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2024-10-14 02:55:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 8916. [2024-10-14 02:55:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8916 states, 7311 states have (on average 1.640951990151826) internal successors, (11997), 7318 states have internal predecessors, (11997), 1577 states have call successors, (1577), 23 states have call predecessors, (1577), 27 states have return successors, (1772), 1576 states have call predecessors, (1772), 1576 states have call successors, (1772) [2024-10-14 02:55:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8916 states to 8916 states and 15346 transitions. [2024-10-14 02:55:26,365 INFO L78 Accepts]: Start accepts. Automaton has 8916 states and 15346 transitions. Word has length 119 [2024-10-14 02:55:26,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:26,365 INFO L471 AbstractCegarLoop]: Abstraction has 8916 states and 15346 transitions. [2024-10-14 02:55:26,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:26,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8916 states and 15346 transitions. [2024-10-14 02:55:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 02:55:26,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:26,394 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:26,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 02:55:26,394 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:26,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash 506924713, now seen corresponding path program 1 times [2024-10-14 02:55:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:26,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043069476] [2024-10-14 02:55:26,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:26,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 02:55:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:55:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:55:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:55:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:55:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 02:55:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 02:55:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:26,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043069476] [2024-10-14 02:55:26,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043069476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:26,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:26,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:55:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952546353] [2024-10-14 02:55:26,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:26,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:55:26,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:26,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:55:26,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:55:26,509 INFO L87 Difference]: Start difference. First operand 8916 states and 15346 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:28,020 INFO L93 Difference]: Finished difference Result 23140 states and 40607 transitions. [2024-10-14 02:55:28,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:55:28,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2024-10-14 02:55:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:28,094 INFO L225 Difference]: With dead ends: 23140 [2024-10-14 02:55:28,094 INFO L226 Difference]: Without dead ends: 15737 [2024-10-14 02:55:28,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:55:28,130 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1185 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:28,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 770 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 02:55:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15737 states. [2024-10-14 02:55:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15737 to 15588. [2024-10-14 02:55:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15588 states, 12780 states have (on average 1.6320813771517997) internal successors, (20858), 12787 states have internal predecessors, (20858), 2780 states have call successors, (2780), 23 states have call predecessors, (2780), 27 states have return successors, (3119), 2779 states have call predecessors, (3119), 2779 states have call successors, (3119) [2024-10-14 02:55:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15588 states to 15588 states and 26757 transitions. [2024-10-14 02:55:28,876 INFO L78 Accepts]: Start accepts. Automaton has 15588 states and 26757 transitions. Word has length 120 [2024-10-14 02:55:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:28,877 INFO L471 AbstractCegarLoop]: Abstraction has 15588 states and 26757 transitions. [2024-10-14 02:55:28,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 15588 states and 26757 transitions. [2024-10-14 02:55:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 02:55:28,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:28,911 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:28,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 02:55:28,912 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:28,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1059107364, now seen corresponding path program 1 times [2024-10-14 02:55:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:28,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313665285] [2024-10-14 02:55:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:28,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:55:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:55:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:55:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:55:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:55:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 02:55:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 02:55:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:29,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:29,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313665285] [2024-10-14 02:55:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313665285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:29,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:29,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:55:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028093976] [2024-10-14 02:55:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:29,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:55:29,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:29,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:55:29,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:55:29,184 INFO L87 Difference]: Start difference. First operand 15588 states and 26757 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:31,240 INFO L93 Difference]: Finished difference Result 41307 states and 72407 transitions. [2024-10-14 02:55:31,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:55:31,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-14 02:55:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:31,387 INFO L225 Difference]: With dead ends: 41307 [2024-10-14 02:55:31,388 INFO L226 Difference]: Without dead ends: 27852 [2024-10-14 02:55:31,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:55:31,566 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1183 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:31,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 712 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 02:55:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27852 states. [2024-10-14 02:55:32,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27852 to 27703. [2024-10-14 02:55:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27703 states, 22856 states have (on average 1.6285439271963598) internal successors, (37222), 22863 states have internal predecessors, (37222), 4819 states have call successors, (4819), 23 states have call predecessors, (4819), 27 states have return successors, (5432), 4818 states have call predecessors, (5432), 4818 states have call successors, (5432) [2024-10-14 02:55:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27703 states to 27703 states and 47473 transitions. [2024-10-14 02:55:32,635 INFO L78 Accepts]: Start accepts. Automaton has 27703 states and 47473 transitions. Word has length 121 [2024-10-14 02:55:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:32,637 INFO L471 AbstractCegarLoop]: Abstraction has 27703 states and 47473 transitions. [2024-10-14 02:55:32,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 27703 states and 47473 transitions. [2024-10-14 02:55:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 02:55:32,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:32,671 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:32,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 02:55:32,671 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:32,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash 118598503, now seen corresponding path program 1 times [2024-10-14 02:55:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:32,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723188527] [2024-10-14 02:55:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:32,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:55:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:55:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:55:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:55:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 02:55:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 02:55:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 02:55:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:32,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:32,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723188527] [2024-10-14 02:55:32,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723188527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:32,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:32,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:55:32,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78168357] [2024-10-14 02:55:32,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:32,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:55:32,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:55:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:55:32,789 INFO L87 Difference]: Start difference. First operand 27703 states and 47473 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:35,450 INFO L93 Difference]: Finished difference Result 75499 states and 131596 transitions. [2024-10-14 02:55:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:55:35,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-14 02:55:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:35,689 INFO L225 Difference]: With dead ends: 75499 [2024-10-14 02:55:35,689 INFO L226 Difference]: Without dead ends: 50676 [2024-10-14 02:55:35,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:55:35,764 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1181 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:35,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 720 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 02:55:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50676 states. [2024-10-14 02:55:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50676 to 50527. [2024-10-14 02:55:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50527 states, 41965 states have (on average 1.6236387465745263) internal successors, (68136), 41972 states have internal predecessors, (68136), 8534 states have call successors, (8534), 23 states have call predecessors, (8534), 27 states have return successors, (9679), 8533 states have call predecessors, (9679), 8533 states have call successors, (9679) [2024-10-14 02:55:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50527 states to 50527 states and 86349 transitions. [2024-10-14 02:55:38,173 INFO L78 Accepts]: Start accepts. Automaton has 50527 states and 86349 transitions. Word has length 122 [2024-10-14 02:55:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:38,173 INFO L471 AbstractCegarLoop]: Abstraction has 50527 states and 86349 transitions. [2024-10-14 02:55:38,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 50527 states and 86349 transitions. [2024-10-14 02:55:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 02:55:38,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:38,215 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:38,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 02:55:38,215 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:38,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:38,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1201086500, now seen corresponding path program 1 times [2024-10-14 02:55:38,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:38,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610957044] [2024-10-14 02:55:38,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:38,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:55:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:55:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:55:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:55:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:55:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 02:55:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 02:55:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:38,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:38,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610957044] [2024-10-14 02:55:38,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610957044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:38,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:38,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:55:38,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498903755] [2024-10-14 02:55:38,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:38,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:55:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:38,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:55:38,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:55:38,345 INFO L87 Difference]: Start difference. First operand 50527 states and 86349 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:41,844 INFO L93 Difference]: Finished difference Result 94246 states and 164759 transitions. [2024-10-14 02:55:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:55:41,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-14 02:55:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:42,307 INFO L225 Difference]: With dead ends: 94246 [2024-10-14 02:55:42,307 INFO L226 Difference]: Without dead ends: 94056 [2024-10-14 02:55:42,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:55:42,367 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1176 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:42,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 718 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 02:55:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94056 states. [2024-10-14 02:55:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94056 to 93907. [2024-10-14 02:55:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93907 states, 78546 states have (on average 1.6172306673796246) internal successors, (127027), 78553 states have internal predecessors, (127027), 15333 states have call successors, (15333), 23 states have call predecessors, (15333), 27 states have return successors, (17524), 15332 states have call predecessors, (17524), 15332 states have call successors, (17524) [2024-10-14 02:55:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93907 states to 93907 states and 159884 transitions. [2024-10-14 02:55:46,151 INFO L78 Accepts]: Start accepts. Automaton has 93907 states and 159884 transitions. Word has length 123 [2024-10-14 02:55:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:55:46,151 INFO L471 AbstractCegarLoop]: Abstraction has 93907 states and 159884 transitions. [2024-10-14 02:55:46,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:55:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 93907 states and 159884 transitions. [2024-10-14 02:55:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 02:55:46,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:55:46,202 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:55:46,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 02:55:46,203 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:55:46,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:55:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash 961517096, now seen corresponding path program 1 times [2024-10-14 02:55:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:55:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390163941] [2024-10-14 02:55:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:55:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:55:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:46,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:55:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:46,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:55:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:46,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:55:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:46,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:55:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:55:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:46,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:55:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:47,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:55:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:47,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:55:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:47,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 02:55:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:55:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 02:55:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:47,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 02:55:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 02:55:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:55:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:55:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:55:47,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390163941] [2024-10-14 02:55:47,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390163941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:55:47,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:55:47,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-14 02:55:47,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135231348] [2024-10-14 02:55:47,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:55:47,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 02:55:47,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:55:47,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 02:55:47,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:55:47,313 INFO L87 Difference]: Start difference. First operand 93907 states and 159884 transitions. Second operand has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-14 02:55:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:55:57,706 INFO L93 Difference]: Finished difference Result 187933 states and 331875 transitions. [2024-10-14 02:55:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-14 02:55:57,707 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 124 [2024-10-14 02:55:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:55:58,911 INFO L225 Difference]: With dead ends: 187933 [2024-10-14 02:55:58,911 INFO L226 Difference]: Without dead ends: 187748 [2024-10-14 02:55:59,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2024-10-14 02:55:59,015 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 4165 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 9063 mSolverCounterSat, 1481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4176 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 10544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1481 IncrementalHoareTripleChecker+Valid, 9063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:55:59,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4176 Valid, 2367 Invalid, 10544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1481 Valid, 9063 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-14 02:55:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187748 states.