/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/product-lines/email_spec7_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:51:14,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:51:14,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 22:51:14,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:51:14,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:51:14,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:51:14,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:51:14,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:51:14,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:51:14,797 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:51:14,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:51:14,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:51:14,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:51:14,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:51:14,799 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:51:14,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:51:14,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:51:14,800 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:51:14,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:51:14,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:51:14,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:51:14,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:51:14,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:51:14,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:51:14,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:51:14,802 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:51:14,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:51:14,802 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:51:14,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:51:14,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:51:14,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:51:14,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:51:14,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:51:14,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:51:14,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:51:14,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:51:14,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:51:14,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:51:14,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:51:14,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:51:14,805 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:51:14,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:51:14,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:51:14,805 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: Use bitabs translation -> true [2023-12-15 22:51:14,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:51:15,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:51:15,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:51:15,011 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:51:15,011 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:51:15,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product31.cil.c [2023-12-15 22:51:16,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:51:16,427 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:51:16,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product31.cil.c [2023-12-15 22:51:16,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099e0f0d3/582dcbf9b2244b9ea918243557d03f8f/FLAG75bfc8928 [2023-12-15 22:51:16,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099e0f0d3/582dcbf9b2244b9ea918243557d03f8f [2023-12-15 22:51:16,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:51:16,461 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:51:16,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:51:16,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:51:16,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:51:16,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:51:16" (1/1) ... [2023-12-15 22:51:16,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143daa92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:16, skipping insertion in model container [2023-12-15 22:51:16,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:51:16" (1/1) ... [2023-12-15 22:51:16,530 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:51:16,753 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product31.cil.c[7290,7303] [2023-12-15 22:51:16,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:51:16,999 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:51:17,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2023-12-15 22:51:17,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [363] [2023-12-15 22:51:17,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [383] [2023-12-15 22:51:17,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [392] [2023-12-15 22:51:17,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [764] [2023-12-15 22:51:17,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1163] [2023-12-15 22:51:17,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1529] [2023-12-15 22:51:17,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1664] [2023-12-15 22:51:17,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1681] [2023-12-15 22:51:17,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1716] [2023-12-15 22:51:17,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2783] [2023-12-15 22:51:17,016 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product31.cil.c[7290,7303] [2023-12-15 22:51:17,113 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:51:17,147 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:51:17,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17 WrapperNode [2023-12-15 22:51:17,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:51:17,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:51:17,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:51:17,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:51:17,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,231 INFO L138 Inliner]: procedures = 131, calls = 203, calls flagged for inlining = 61, calls inlined = 56, statements flattened = 999 [2023-12-15 22:51:17,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:51:17,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:51:17,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:51:17,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:51:17,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,272 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]. [2023-12-15 22:51:17,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:51:17,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:51:17,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:51:17,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:51:17,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (1/1) ... [2023-12-15 22:51:17,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:51:17,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:51:17,377 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) [2023-12-15 22:51:17,416 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 [2023-12-15 22:51:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2023-12-15 22:51:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2023-12-15 22:51:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2023-12-15 22:51:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2023-12-15 22:51:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2023-12-15 22:51:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2023-12-15 22:51:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2023-12-15 22:51:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2023-12-15 22:51:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2023-12-15 22:51:17,423 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2023-12-15 22:51:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2023-12-15 22:51:17,423 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2023-12-15 22:51:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2023-12-15 22:51:17,423 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2023-12-15 22:51:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2023-12-15 22:51:17,424 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2023-12-15 22:51:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2023-12-15 22:51:17,425 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2023-12-15 22:51:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2023-12-15 22:51:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2023-12-15 22:51:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2023-12-15 22:51:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2023-12-15 22:51:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2023-12-15 22:51:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2023-12-15 22:51:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:51:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2023-12-15 22:51:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2023-12-15 22:51:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2023-12-15 22:51:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2023-12-15 22:51:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2023-12-15 22:51:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2023-12-15 22:51:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2023-12-15 22:51:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2023-12-15 22:51:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2023-12-15 22:51:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2023-12-15 22:51:17,427 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2023-12-15 22:51:17,427 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2023-12-15 22:51:17,427 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2023-12-15 22:51:17,427 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2023-12-15 22:51:17,427 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2023-12-15 22:51:17,427 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2023-12-15 22:51:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:51:17,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:51:17,612 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:51:17,614 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:51:18,234 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:51:18,293 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:51:18,293 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 22:51:18,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:51:18 BoogieIcfgContainer [2023-12-15 22:51:18,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:51:18,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:51:18,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:51:18,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:51:18,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:51:16" (1/3) ... [2023-12-15 22:51:18,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3492287c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:51:18, skipping insertion in model container [2023-12-15 22:51:18,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:51:17" (2/3) ... [2023-12-15 22:51:18,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3492287c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:51:18, skipping insertion in model container [2023-12-15 22:51:18,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:51:18" (3/3) ... [2023-12-15 22:51:18,300 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product31.cil.c [2023-12-15 22:51:18,312 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:51:18,312 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:51:18,363 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:51:18,368 INFO L357 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, mHoare=true, 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;@3f034d06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:51:18,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:51:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 252 states have (on average 1.5634920634920635) internal successors, (394), 256 states have internal predecessors, (394), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-15 22:51:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 22:51:18,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:18,393 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:18,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:18,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404715, now seen corresponding path program 1 times [2023-12-15 22:51:18,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117978955] [2023-12-15 22:51:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 22:51:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:51:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:51:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 22:51:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 22:51:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:51:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 22:51:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:51:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 22:51:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 22:51:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 22:51:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:18,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-15 22:51:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:19,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:51:19,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:19,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117978955] [2023-12-15 22:51:19,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117978955] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:51:19,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705084419] [2023-12-15 22:51:19,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:19,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:51:19,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:51:19,013 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) [2023-12-15 22:51:19,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 22:51:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:19,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-15 22:51:19,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:51:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-15 22:51:19,345 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:51:19,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705084419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:19,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:51:19,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2023-12-15 22:51:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206206224] [2023-12-15 22:51:19,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:19,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 22:51:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:19,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 22:51:19,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:51:19,389 INFO L87 Difference]: Start difference. First operand has 335 states, 252 states have (on average 1.5634920634920635) internal successors, (394), 256 states have internal predecessors, (394), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:19,482 INFO L93 Difference]: Finished difference Result 525 states and 783 transitions. [2023-12-15 22:51:19,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 22:51:19,485 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 114 [2023-12-15 22:51:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:19,501 INFO L225 Difference]: With dead ends: 525 [2023-12-15 22:51:19,501 INFO L226 Difference]: Without dead ends: 332 [2023-12-15 22:51:19,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:51:19,508 INFO L413 NwaCegarLoop]: 490 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, 490 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 [2023-12-15 22:51:19,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:51:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-12-15 22:51:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2023-12-15 22:51:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 250 states have (on average 1.548) internal successors, (387), 253 states have internal predecessors, (387), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2023-12-15 22:51:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 502 transitions. [2023-12-15 22:51:19,575 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 502 transitions. Word has length 114 [2023-12-15 22:51:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:19,578 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 502 transitions. [2023-12-15 22:51:19,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 502 transitions. [2023-12-15 22:51:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 22:51:19,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:19,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:19,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 22:51:19,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-15 22:51:19,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:19,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash -407992104, now seen corresponding path program 1 times [2023-12-15 22:51:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:19,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902679680] [2023-12-15 22:51:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:19,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:19,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:19,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 22:51:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:51:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:51:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-15 22:51:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 22:51:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 22:51:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:51:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:51:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 22:51:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 22:51:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 22:51:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 22:51:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:51:20,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902679680] [2023-12-15 22:51:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902679680] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:51:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641344148] [2023-12-15 22:51:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:20,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:51:20,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:51:20,065 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) [2023-12-15 22:51:20,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 22:51:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 22:51:20,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:51:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-15 22:51:20,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:51:20,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641344148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:20,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:51:20,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-12-15 22:51:20,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357028232] [2023-12-15 22:51:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:20,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:51:20,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:51:20,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:51:20,360 INFO L87 Difference]: Start difference. First operand 332 states and 502 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:20,396 INFO L93 Difference]: Finished difference Result 521 states and 770 transitions. [2023-12-15 22:51:20,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:51:20,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2023-12-15 22:51:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:20,399 INFO L225 Difference]: With dead ends: 521 [2023-12-15 22:51:20,399 INFO L226 Difference]: Without dead ends: 334 [2023-12-15 22:51:20,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:51:20,401 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 0 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 973 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 [2023-12-15 22:51:20,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 973 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:51:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-15 22:51:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2023-12-15 22:51:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 252 states have (on average 1.5436507936507937) internal successors, (389), 255 states have internal predecessors, (389), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2023-12-15 22:51:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 504 transitions. [2023-12-15 22:51:20,417 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 504 transitions. Word has length 115 [2023-12-15 22:51:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:20,417 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 504 transitions. [2023-12-15 22:51:20,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 504 transitions. [2023-12-15 22:51:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 22:51:20,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:20,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:20,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 22:51:20,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-15 22:51:20,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:20,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash 690428878, now seen corresponding path program 1 times [2023-12-15 22:51:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:20,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094516730] [2023-12-15 22:51:20,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 22:51:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:51:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:51:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 22:51:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 22:51:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-15 22:51:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:51:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 22:51:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 22:51:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 22:51:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 22:51:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 22:51:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-15 22:51:20,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:20,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094516730] [2023-12-15 22:51:20,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094516730] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:51:20,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384343554] [2023-12-15 22:51:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:20,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:51:20,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:51:20,809 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) [2023-12-15 22:51:20,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 22:51:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 22:51:21,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:51:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-15 22:51:21,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:51:21,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384343554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:21,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:51:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-12-15 22:51:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371795224] [2023-12-15 22:51:21,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:21,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:51:21,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:21,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:51:21,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:51:21,079 INFO L87 Difference]: Start difference. First operand 334 states and 504 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:21,123 INFO L93 Difference]: Finished difference Result 698 states and 1067 transitions. [2023-12-15 22:51:21,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:51:21,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 120 [2023-12-15 22:51:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:21,126 INFO L225 Difference]: With dead ends: 698 [2023-12-15 22:51:21,126 INFO L226 Difference]: Without dead ends: 386 [2023-12-15 22:51:21,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:51:21,128 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 102 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:21,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 940 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:51:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-12-15 22:51:21,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 381. [2023-12-15 22:51:21,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 288 states have (on average 1.5590277777777777) internal successors, (449), 291 states have internal predecessors, (449), 69 states have call successors, (69), 23 states have call predecessors, (69), 23 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 22:51:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 586 transitions. [2023-12-15 22:51:21,146 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 586 transitions. Word has length 120 [2023-12-15 22:51:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:21,146 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 586 transitions. [2023-12-15 22:51:21,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 586 transitions. [2023-12-15 22:51:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 22:51:21,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:21,148 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:21,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 22:51:21,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:51:21,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:21,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1105393125, now seen corresponding path program 1 times [2023-12-15 22:51:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:21,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493151953] [2023-12-15 22:51:21,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:21,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 22:51:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:51:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:51:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 22:51:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 22:51:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 22:51:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:51:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 22:51:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 22:51:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 22:51:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-15 22:51:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 22:51:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-15 22:51:21,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:21,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493151953] [2023-12-15 22:51:21,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493151953] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:51:21,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119988954] [2023-12-15 22:51:21,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:21,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:51:21,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:51:21,575 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) [2023-12-15 22:51:21,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 22:51:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:21,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 22:51:21,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:51:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-15 22:51:21,861 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:51:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119988954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:51:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-15 22:51:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761461587] [2023-12-15 22:51:21,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:21,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:51:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:21,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:51:21,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:51:21,863 INFO L87 Difference]: Start difference. First operand 381 states and 586 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-15 22:51:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:21,957 INFO L93 Difference]: Finished difference Result 757 states and 1166 transitions. [2023-12-15 22:51:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 22:51:21,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 121 [2023-12-15 22:51:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:21,960 INFO L225 Difference]: With dead ends: 757 [2023-12-15 22:51:21,960 INFO L226 Difference]: Without dead ends: 383 [2023-12-15 22:51:21,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:21,962 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 8 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:21,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1901 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:51:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-12-15 22:51:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2023-12-15 22:51:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 289 states have (on average 1.5570934256055364) internal successors, (450), 293 states have internal predecessors, (450), 69 states have call successors, (69), 23 states have call predecessors, (69), 24 states have return successors, (70), 68 states have call predecessors, (70), 68 states have call successors, (70) [2023-12-15 22:51:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 589 transitions. [2023-12-15 22:51:21,977 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 589 transitions. Word has length 121 [2023-12-15 22:51:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:21,977 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 589 transitions. [2023-12-15 22:51:21,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-15 22:51:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 589 transitions. [2023-12-15 22:51:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-15 22:51:21,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:21,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:21,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 22:51:22,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:51:22,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:22,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:22,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1448072128, now seen corresponding path program 1 times [2023-12-15 22:51:22,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:22,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667453887] [2023-12-15 22:51:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-15 22:51:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-15 22:51:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 22:51:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:51:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 22:51:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:51:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 22:51:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 22:51:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 22:51:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-15 22:51:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 22:51:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 22:51:22,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:22,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667453887] [2023-12-15 22:51:22,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667453887] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:51:22,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041932625] [2023-12-15 22:51:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:22,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:51:22,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:51:22,399 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) [2023-12-15 22:51:22,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 22:51:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:22,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 22:51:22,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:51:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-15 22:51:22,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:51:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041932625] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:22,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:51:22,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2023-12-15 22:51:22,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336972535] [2023-12-15 22:51:22,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:22,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:51:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:22,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:51:22,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-12-15 22:51:22,700 INFO L87 Difference]: Start difference. First operand 383 states and 589 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-15 22:51:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:22,808 INFO L93 Difference]: Finished difference Result 759 states and 1171 transitions. [2023-12-15 22:51:22,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 22:51:22,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 122 [2023-12-15 22:51:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:22,810 INFO L225 Difference]: With dead ends: 759 [2023-12-15 22:51:22,810 INFO L226 Difference]: Without dead ends: 385 [2023-12-15 22:51:22,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-12-15 22:51:22,812 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 8 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:22,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1887 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:51:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-12-15 22:51:22,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2023-12-15 22:51:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 290 states have (on average 1.5551724137931036) internal successors, (451), 295 states have internal predecessors, (451), 69 states have call successors, (69), 23 states have call predecessors, (69), 25 states have return successors, (75), 68 states have call predecessors, (75), 68 states have call successors, (75) [2023-12-15 22:51:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 595 transitions. [2023-12-15 22:51:22,824 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 595 transitions. Word has length 122 [2023-12-15 22:51:22,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:22,824 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 595 transitions. [2023-12-15 22:51:22,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-15 22:51:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 595 transitions. [2023-12-15 22:51:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 22:51:22,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:22,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:22,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-15 22:51:23,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:51:23,033 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:23,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:23,034 INFO L85 PathProgramCache]: Analyzing trace with hash 565152126, now seen corresponding path program 1 times [2023-12-15 22:51:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:23,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529784949] [2023-12-15 22:51:23,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:23,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 22:51:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 22:51:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 22:51:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:51:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 22:51:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 22:51:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 22:51:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 22:51:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 22:51:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 22:51:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-15 22:51:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:23,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529784949] [2023-12-15 22:51:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529784949] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:23,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:23,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 22:51:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908530142] [2023-12-15 22:51:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:23,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 22:51:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 22:51:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:51:23,199 INFO L87 Difference]: Start difference. First operand 385 states and 595 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-15 22:51:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:24,640 INFO L93 Difference]: Finished difference Result 892 states and 1391 transitions. [2023-12-15 22:51:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 22:51:24,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 123 [2023-12-15 22:51:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:24,643 INFO L225 Difference]: With dead ends: 892 [2023-12-15 22:51:24,643 INFO L226 Difference]: Without dead ends: 526 [2023-12-15 22:51:24,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-15 22:51:24,644 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 1217 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:24,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 963 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 22:51:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-12-15 22:51:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 385. [2023-12-15 22:51:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 290 states have (on average 1.5551724137931036) internal successors, (451), 295 states have internal predecessors, (451), 69 states have call successors, (69), 23 states have call predecessors, (69), 25 states have return successors, (74), 68 states have call predecessors, (74), 68 states have call successors, (74) [2023-12-15 22:51:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 594 transitions. [2023-12-15 22:51:24,674 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 594 transitions. Word has length 123 [2023-12-15 22:51:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:24,674 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 594 transitions. [2023-12-15 22:51:24,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-15 22:51:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 594 transitions. [2023-12-15 22:51:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-15 22:51:24,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:24,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:24,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 22:51:24,676 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:24,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1990744649, now seen corresponding path program 2 times [2023-12-15 22:51:24,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:24,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751921216] [2023-12-15 22:51:24,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:24,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 22:51:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 22:51:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 22:51:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 22:51:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 22:51:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 22:51:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 22:51:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 22:51:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 22:51:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 22:51:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-15 22:51:24,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:24,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751921216] [2023-12-15 22:51:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751921216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:24,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 22:51:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494048298] [2023-12-15 22:51:24,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:24,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 22:51:24,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 22:51:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:51:24,866 INFO L87 Difference]: Start difference. First operand 385 states and 594 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-15 22:51:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:26,263 INFO L93 Difference]: Finished difference Result 894 states and 1394 transitions. [2023-12-15 22:51:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 22:51:26,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 124 [2023-12-15 22:51:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:26,266 INFO L225 Difference]: With dead ends: 894 [2023-12-15 22:51:26,266 INFO L226 Difference]: Without dead ends: 528 [2023-12-15 22:51:26,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-15 22:51:26,268 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 1118 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2611 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:26,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 963 Invalid, 3010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 2611 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 22:51:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-15 22:51:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 387. [2023-12-15 22:51:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 291 states have (on average 1.5532646048109966) internal successors, (452), 297 states have internal predecessors, (452), 69 states have call successors, (69), 23 states have call predecessors, (69), 26 states have return successors, (76), 68 states have call predecessors, (76), 68 states have call successors, (76) [2023-12-15 22:51:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 597 transitions. [2023-12-15 22:51:26,293 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 597 transitions. Word has length 124 [2023-12-15 22:51:26,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:26,293 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 597 transitions. [2023-12-15 22:51:26,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-15 22:51:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 597 transitions. [2023-12-15 22:51:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 22:51:26,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:26,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:26,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 22:51:26,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:26,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1827938525, now seen corresponding path program 1 times [2023-12-15 22:51:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830268205] [2023-12-15 22:51:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 22:51:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 22:51:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 22:51:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 22:51:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 22:51:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 22:51:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 22:51:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-15 22:51:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 22:51:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 22:51:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:26,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830268205] [2023-12-15 22:51:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830268205] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:26,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:26,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 22:51:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797466432] [2023-12-15 22:51:26,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:26,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 22:51:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:26,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 22:51:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:51:26,463 INFO L87 Difference]: Start difference. First operand 387 states and 597 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-15 22:51:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:28,385 INFO L93 Difference]: Finished difference Result 892 states and 1389 transitions. [2023-12-15 22:51:28,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:51:28,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2023-12-15 22:51:28,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:28,389 INFO L225 Difference]: With dead ends: 892 [2023-12-15 22:51:28,389 INFO L226 Difference]: Without dead ends: 528 [2023-12-15 22:51:28,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2023-12-15 22:51:28,391 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 1182 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 4098 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 4541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 4098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:28,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 1332 Invalid, 4541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 4098 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 22:51:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-15 22:51:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 387. [2023-12-15 22:51:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 291 states have (on average 1.5532646048109966) internal successors, (452), 297 states have internal predecessors, (452), 69 states have call successors, (69), 23 states have call predecessors, (69), 26 states have return successors, (75), 68 states have call predecessors, (75), 68 states have call successors, (75) [2023-12-15 22:51:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 596 transitions. [2023-12-15 22:51:28,417 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 596 transitions. Word has length 125 [2023-12-15 22:51:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:28,418 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 596 transitions. [2023-12-15 22:51:28,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-15 22:51:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 596 transitions. [2023-12-15 22:51:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-15 22:51:28,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:28,419 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:28,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 22:51:28,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:28,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash -626909401, now seen corresponding path program 2 times [2023-12-15 22:51:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:28,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133415962] [2023-12-15 22:51:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 22:51:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 22:51:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 22:51:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 22:51:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 22:51:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 22:51:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 22:51:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 22:51:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 22:51:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 22:51:28,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:28,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133415962] [2023-12-15 22:51:28,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133415962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:28,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:28,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 22:51:28,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957879472] [2023-12-15 22:51:28,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:28,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 22:51:28,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:28,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 22:51:28,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:51:28,596 INFO L87 Difference]: Start difference. First operand 387 states and 596 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-15 22:51:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:30,732 INFO L93 Difference]: Finished difference Result 894 states and 1395 transitions. [2023-12-15 22:51:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:51:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 126 [2023-12-15 22:51:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:30,735 INFO L225 Difference]: With dead ends: 894 [2023-12-15 22:51:30,735 INFO L226 Difference]: Without dead ends: 530 [2023-12-15 22:51:30,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2023-12-15 22:51:30,737 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 1138 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 4191 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 4610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 4191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:30,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 1332 Invalid, 4610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 4191 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-15 22:51:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-12-15 22:51:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 389. [2023-12-15 22:51:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 292 states have (on average 1.5513698630136987) internal successors, (453), 299 states have internal predecessors, (453), 69 states have call successors, (69), 23 states have call predecessors, (69), 27 states have return successors, (80), 68 states have call predecessors, (80), 68 states have call successors, (80) [2023-12-15 22:51:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 602 transitions. [2023-12-15 22:51:30,755 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 602 transitions. Word has length 126 [2023-12-15 22:51:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:30,755 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 602 transitions. [2023-12-15 22:51:30,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-15 22:51:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 602 transitions. [2023-12-15 22:51:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 22:51:30,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:30,757 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:30,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 22:51:30,757 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:30,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:30,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1954195350, now seen corresponding path program 1 times [2023-12-15 22:51:30,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:30,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933239457] [2023-12-15 22:51:30,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:30,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:51:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 22:51:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:51:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 22:51:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 22:51:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 22:51:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-15 22:51:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 22:51:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 22:51:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-15 22:51:30,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:30,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933239457] [2023-12-15 22:51:30,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933239457] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:30,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:30,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 22:51:30,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093973887] [2023-12-15 22:51:30,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:30,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 22:51:30,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:30,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 22:51:30,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:51:30,875 INFO L87 Difference]: Start difference. First operand 389 states and 602 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-15 22:51:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:32,501 INFO L93 Difference]: Finished difference Result 896 states and 1398 transitions. [2023-12-15 22:51:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 22:51:32,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 127 [2023-12-15 22:51:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:32,504 INFO L225 Difference]: With dead ends: 896 [2023-12-15 22:51:32,504 INFO L226 Difference]: Without dead ends: 530 [2023-12-15 22:51:32,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-12-15 22:51:32,505 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 1206 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:32,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 959 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-15 22:51:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-12-15 22:51:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 389. [2023-12-15 22:51:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 292 states have (on average 1.5513698630136987) internal successors, (453), 299 states have internal predecessors, (453), 69 states have call successors, (69), 23 states have call predecessors, (69), 27 states have return successors, (80), 68 states have call predecessors, (80), 68 states have call successors, (80) [2023-12-15 22:51:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 602 transitions. [2023-12-15 22:51:32,527 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 602 transitions. Word has length 127 [2023-12-15 22:51:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:32,527 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 602 transitions. [2023-12-15 22:51:32,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-15 22:51:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 602 transitions. [2023-12-15 22:51:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 22:51:32,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:32,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:32,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 22:51:32,529 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:32,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:32,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1367919128, now seen corresponding path program 1 times [2023-12-15 22:51:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:32,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699249790] [2023-12-15 22:51:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:32,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:51:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 22:51:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:51:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 22:51:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 22:51:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 22:51:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-15 22:51:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 22:51:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 22:51:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:32,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:32,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699249790] [2023-12-15 22:51:32,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699249790] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:51:32,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146640946] [2023-12-15 22:51:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:32,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:51:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:51:32,658 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) [2023-12-15 22:51:32,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 22:51:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:32,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 22:51:32,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:51:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:32,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:51:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:32,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146640946] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:51:32,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:51:32,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2023-12-15 22:51:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54049572] [2023-12-15 22:51:32,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:51:32,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 22:51:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 22:51:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-15 22:51:32,973 INFO L87 Difference]: Start difference. First operand 389 states and 602 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (37), 6 states have call predecessors, (37), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-15 22:51:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:34,196 INFO L93 Difference]: Finished difference Result 1047 states and 1706 transitions. [2023-12-15 22:51:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 22:51:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (37), 6 states have call predecessors, (37), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 127 [2023-12-15 22:51:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:34,201 INFO L225 Difference]: With dead ends: 1047 [2023-12-15 22:51:34,201 INFO L226 Difference]: Without dead ends: 860 [2023-12-15 22:51:34,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-12-15 22:51:34,203 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 1670 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:34,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 1204 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 22:51:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2023-12-15 22:51:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 704. [2023-12-15 22:51:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 543 states have (on average 1.6169429097605894) internal successors, (878), 550 states have internal predecessors, (878), 133 states have call successors, (133), 23 states have call predecessors, (133), 27 states have return successors, (154), 132 states have call predecessors, (154), 132 states have call successors, (154) [2023-12-15 22:51:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1165 transitions. [2023-12-15 22:51:34,231 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1165 transitions. Word has length 127 [2023-12-15 22:51:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:34,232 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 1165 transitions. [2023-12-15 22:51:34,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (37), 6 states have call predecessors, (37), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-15 22:51:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1165 transitions. [2023-12-15 22:51:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 22:51:34,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:34,235 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:34,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 22:51:34,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:51:34,442 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:34,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1167466043, now seen corresponding path program 1 times [2023-12-15 22:51:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:34,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207689687] [2023-12-15 22:51:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-15 22:51:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 22:51:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 22:51:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 22:51:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 22:51:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-15 22:51:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 22:51:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 22:51:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 22:51:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:34,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:34,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207689687] [2023-12-15 22:51:34,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207689687] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:34,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:34,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:51:34,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321858271] [2023-12-15 22:51:34,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:34,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:51:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:34,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:51:34,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:51:34,515 INFO L87 Difference]: Start difference. First operand 704 states and 1165 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:35,551 INFO L93 Difference]: Finished difference Result 1806 states and 3055 transitions. [2023-12-15 22:51:35,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:51:35,552 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2023-12-15 22:51:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:35,557 INFO L225 Difference]: With dead ends: 1806 [2023-12-15 22:51:35,557 INFO L226 Difference]: Without dead ends: 1162 [2023-12-15 22:51:35,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:35,560 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 1287 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:35,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 747 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 22:51:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2023-12-15 22:51:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1016. [2023-12-15 22:51:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 791 states have (on average 1.6308470290771175) internal successors, (1290), 798 states have internal predecessors, (1290), 197 states have call successors, (197), 23 states have call predecessors, (197), 27 states have return successors, (228), 196 states have call predecessors, (228), 196 states have call successors, (228) [2023-12-15 22:51:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1715 transitions. [2023-12-15 22:51:35,596 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1715 transitions. Word has length 133 [2023-12-15 22:51:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:35,596 INFO L495 AbstractCegarLoop]: Abstraction has 1016 states and 1715 transitions. [2023-12-15 22:51:35,597 INFO L496 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1715 transitions. [2023-12-15 22:51:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-15 22:51:35,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:35,600 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:35,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 22:51:35,600 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:35,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash -90831061, now seen corresponding path program 1 times [2023-12-15 22:51:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:35,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173232542] [2023-12-15 22:51:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 22:51:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 22:51:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 22:51:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 22:51:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 22:51:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-15 22:51:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 22:51:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 22:51:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 22:51:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:35,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:35,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173232542] [2023-12-15 22:51:35,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173232542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:35,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:35,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:51:35,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396648541] [2023-12-15 22:51:35,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:35,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:51:35,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:35,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:51:35,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:51:35,687 INFO L87 Difference]: Start difference. First operand 1016 states and 1715 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:36,742 INFO L93 Difference]: Finished difference Result 2555 states and 4373 transitions. [2023-12-15 22:51:36,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:51:36,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2023-12-15 22:51:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:36,753 INFO L225 Difference]: With dead ends: 2555 [2023-12-15 22:51:36,754 INFO L226 Difference]: Without dead ends: 1649 [2023-12-15 22:51:36,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:36,758 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 1259 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:36,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 721 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 22:51:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2023-12-15 22:51:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1503. [2023-12-15 22:51:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1183 states have (on average 1.639898562975486) internal successors, (1940), 1190 states have internal predecessors, (1940), 292 states have call successors, (292), 23 states have call predecessors, (292), 27 states have return successors, (323), 291 states have call predecessors, (323), 291 states have call successors, (323) [2023-12-15 22:51:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2555 transitions. [2023-12-15 22:51:36,820 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2555 transitions. Word has length 134 [2023-12-15 22:51:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:36,820 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 2555 transitions. [2023-12-15 22:51:36,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2555 transitions. [2023-12-15 22:51:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 22:51:36,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:36,827 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:36,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 22:51:36,828 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:36,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:36,828 INFO L85 PathProgramCache]: Analyzing trace with hash 477202151, now seen corresponding path program 1 times [2023-12-15 22:51:36,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:36,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273115875] [2023-12-15 22:51:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:36,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 22:51:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:51:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 22:51:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 22:51:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 22:51:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 22:51:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 22:51:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 22:51:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-15 22:51:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:36,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273115875] [2023-12-15 22:51:36,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273115875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:36,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:36,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:51:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381653033] [2023-12-15 22:51:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:36,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:51:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:36,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:51:36,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:51:36,926 INFO L87 Difference]: Start difference. First operand 1503 states and 2555 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:38,118 INFO L93 Difference]: Finished difference Result 3657 states and 6332 transitions. [2023-12-15 22:51:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:51:38,119 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2023-12-15 22:51:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:38,129 INFO L225 Difference]: With dead ends: 3657 [2023-12-15 22:51:38,129 INFO L226 Difference]: Without dead ends: 2384 [2023-12-15 22:51:38,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:38,134 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1285 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:38,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 707 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 22:51:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2023-12-15 22:51:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2238. [2023-12-15 22:51:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 1795 states have (on average 1.6473537604456825) internal successors, (2957), 1802 states have internal predecessors, (2957), 415 states have call successors, (415), 23 states have call predecessors, (415), 27 states have return successors, (462), 414 states have call predecessors, (462), 414 states have call successors, (462) [2023-12-15 22:51:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3834 transitions. [2023-12-15 22:51:38,215 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3834 transitions. Word has length 135 [2023-12-15 22:51:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:38,215 INFO L495 AbstractCegarLoop]: Abstraction has 2238 states and 3834 transitions. [2023-12-15 22:51:38,215 INFO L496 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3834 transitions. [2023-12-15 22:51:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-15 22:51:38,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:38,223 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:38,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 22:51:38,223 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:38,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash 515291788, now seen corresponding path program 1 times [2023-12-15 22:51:38,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:38,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827700461] [2023-12-15 22:51:38,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:51:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:51:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 22:51:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 22:51:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 22:51:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 22:51:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 22:51:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-15 22:51:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-15 22:51:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:38,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:38,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827700461] [2023-12-15 22:51:38,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827700461] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:38,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:38,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:51:38,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688563959] [2023-12-15 22:51:38,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:38,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:51:38,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:38,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:51:38,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:51:38,309 INFO L87 Difference]: Start difference. First operand 2238 states and 3834 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:39,613 INFO L93 Difference]: Finished difference Result 5367 states and 9382 transitions. [2023-12-15 22:51:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:51:39,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2023-12-15 22:51:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:39,628 INFO L225 Difference]: With dead ends: 5367 [2023-12-15 22:51:39,628 INFO L226 Difference]: Without dead ends: 3556 [2023-12-15 22:51:39,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:39,633 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1275 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:39,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 707 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 22:51:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2023-12-15 22:51:39,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 3410. [2023-12-15 22:51:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 2788 states have (on average 1.6524390243902438) internal successors, (4607), 2795 states have internal predecessors, (4607), 594 states have call successors, (594), 23 states have call predecessors, (594), 27 states have return successors, (667), 593 states have call predecessors, (667), 593 states have call successors, (667) [2023-12-15 22:51:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 5868 transitions. [2023-12-15 22:51:39,737 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 5868 transitions. Word has length 136 [2023-12-15 22:51:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:39,738 INFO L495 AbstractCegarLoop]: Abstraction has 3410 states and 5868 transitions. [2023-12-15 22:51:39,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 5868 transitions. [2023-12-15 22:51:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-15 22:51:39,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:39,748 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:39,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 22:51:39,749 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:39,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:39,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1566431907, now seen corresponding path program 1 times [2023-12-15 22:51:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:39,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719157848] [2023-12-15 22:51:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:39,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 22:51:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:51:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 22:51:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 22:51:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 22:51:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-15 22:51:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 22:51:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 22:51:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-15 22:51:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:39,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:39,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719157848] [2023-12-15 22:51:39,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719157848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:39,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:39,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:51:39,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054950683] [2023-12-15 22:51:39,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:39,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:51:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:39,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:51:39,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:51:39,820 INFO L87 Difference]: Start difference. First operand 3410 states and 5868 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:41,130 INFO L93 Difference]: Finished difference Result 8222 states and 14436 transitions. [2023-12-15 22:51:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:51:41,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2023-12-15 22:51:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:41,154 INFO L225 Difference]: With dead ends: 8222 [2023-12-15 22:51:41,154 INFO L226 Difference]: Without dead ends: 5526 [2023-12-15 22:51:41,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:41,162 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 1246 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:41,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 739 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 22:51:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2023-12-15 22:51:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5380. [2023-12-15 22:51:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5380 states, 4382 states have (on average 1.642628936558649) internal successors, (7198), 4389 states have internal predecessors, (7198), 970 states have call successors, (970), 23 states have call predecessors, (970), 27 states have return successors, (1087), 969 states have call predecessors, (1087), 969 states have call successors, (1087) [2023-12-15 22:51:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5380 states to 5380 states and 9255 transitions. [2023-12-15 22:51:41,375 INFO L78 Accepts]: Start accepts. Automaton has 5380 states and 9255 transitions. Word has length 137 [2023-12-15 22:51:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:41,375 INFO L495 AbstractCegarLoop]: Abstraction has 5380 states and 9255 transitions. [2023-12-15 22:51:41,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5380 states and 9255 transitions. [2023-12-15 22:51:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-15 22:51:41,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:41,393 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:41,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 22:51:41,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:41,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1043428656, now seen corresponding path program 1 times [2023-12-15 22:51:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:41,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935121033] [2023-12-15 22:51:41,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:41,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 22:51:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:51:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 22:51:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 22:51:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 22:51:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 22:51:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 22:51:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 22:51:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 22:51:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935121033] [2023-12-15 22:51:41,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935121033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:41,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:41,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:51:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753781057] [2023-12-15 22:51:41,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:41,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:51:41,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:51:41,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:51:41,460 INFO L87 Difference]: Start difference. First operand 5380 states and 9255 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:42,734 INFO L93 Difference]: Finished difference Result 13359 states and 23457 transitions. [2023-12-15 22:51:42,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:51:42,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2023-12-15 22:51:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:42,766 INFO L225 Difference]: With dead ends: 13359 [2023-12-15 22:51:42,766 INFO L226 Difference]: Without dead ends: 9059 [2023-12-15 22:51:42,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:42,776 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 1267 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:42,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 720 Invalid, 1885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 22:51:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9059 states. [2023-12-15 22:51:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9059 to 8913. [2023-12-15 22:51:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8913 states, 7309 states have (on average 1.6409905595840744) internal successors, (11994), 7316 states have internal predecessors, (11994), 1576 states have call successors, (1576), 23 states have call predecessors, (1576), 27 states have return successors, (1771), 1575 states have call predecessors, (1771), 1575 states have call successors, (1771) [2023-12-15 22:51:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8913 states to 8913 states and 15341 transitions. [2023-12-15 22:51:43,098 INFO L78 Accepts]: Start accepts. Automaton has 8913 states and 15341 transitions. Word has length 138 [2023-12-15 22:51:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:43,098 INFO L495 AbstractCegarLoop]: Abstraction has 8913 states and 15341 transitions. [2023-12-15 22:51:43,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8913 states and 15341 transitions. [2023-12-15 22:51:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-15 22:51:43,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:43,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:43,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 22:51:43,124 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:43,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1873632239, now seen corresponding path program 1 times [2023-12-15 22:51:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468726547] [2023-12-15 22:51:43,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 22:51:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 22:51:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 22:51:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 22:51:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 22:51:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 22:51:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 22:51:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-15 22:51:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-15 22:51:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:43,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:43,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468726547] [2023-12-15 22:51:43,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468726547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:43,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:43,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:51:43,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183693023] [2023-12-15 22:51:43,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:43,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:51:43,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:43,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:51:43,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:51:43,262 INFO L87 Difference]: Start difference. First operand 8913 states and 15341 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:44,748 INFO L93 Difference]: Finished difference Result 23131 states and 40591 transitions. [2023-12-15 22:51:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:51:44,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2023-12-15 22:51:44,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:44,792 INFO L225 Difference]: With dead ends: 23131 [2023-12-15 22:51:44,793 INFO L226 Difference]: Without dead ends: 15731 [2023-12-15 22:51:44,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:44,809 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 1287 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:44,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 744 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 22:51:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15731 states. [2023-12-15 22:51:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15731 to 15585. [2023-12-15 22:51:45,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15585 states, 12778 states have (on average 1.6321020503991235) internal successors, (20855), 12785 states have internal predecessors, (20855), 2779 states have call successors, (2779), 23 states have call predecessors, (2779), 27 states have return successors, (3118), 2778 states have call predecessors, (3118), 2778 states have call successors, (3118) [2023-12-15 22:51:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15585 states to 15585 states and 26752 transitions. [2023-12-15 22:51:45,284 INFO L78 Accepts]: Start accepts. Automaton has 15585 states and 26752 transitions. Word has length 139 [2023-12-15 22:51:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:45,284 INFO L495 AbstractCegarLoop]: Abstraction has 15585 states and 26752 transitions. [2023-12-15 22:51:45,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 15585 states and 26752 transitions. [2023-12-15 22:51:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-15 22:51:45,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:45,322 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:45,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 22:51:45,322 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:45,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash 867534673, now seen corresponding path program 1 times [2023-12-15 22:51:45,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:45,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055453568] [2023-12-15 22:51:45,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:45,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:51:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 22:51:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 22:51:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 22:51:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 22:51:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 22:51:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 22:51:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 22:51:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-15 22:51:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:45,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055453568] [2023-12-15 22:51:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055453568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:45,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:45,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:51:45,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337490595] [2023-12-15 22:51:45,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:45,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:51:45,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:45,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:51:45,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:51:45,396 INFO L87 Difference]: Start difference. First operand 15585 states and 26752 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:47,044 INFO L93 Difference]: Finished difference Result 41298 states and 72391 transitions. [2023-12-15 22:51:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:51:47,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2023-12-15 22:51:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:47,218 INFO L225 Difference]: With dead ends: 41298 [2023-12-15 22:51:47,218 INFO L226 Difference]: Without dead ends: 27846 [2023-12-15 22:51:47,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:47,247 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1238 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:47,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 714 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 22:51:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27846 states. [2023-12-15 22:51:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27846 to 27700. [2023-12-15 22:51:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27700 states, 22854 states have (on average 1.6285551763367463) internal successors, (37219), 22861 states have internal predecessors, (37219), 4818 states have call successors, (4818), 23 states have call predecessors, (4818), 27 states have return successors, (5431), 4817 states have call predecessors, (5431), 4817 states have call successors, (5431) [2023-12-15 22:51:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27700 states to 27700 states and 47468 transitions. [2023-12-15 22:51:48,162 INFO L78 Accepts]: Start accepts. Automaton has 27700 states and 47468 transitions. Word has length 140 [2023-12-15 22:51:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:48,162 INFO L495 AbstractCegarLoop]: Abstraction has 27700 states and 47468 transitions. [2023-12-15 22:51:48,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27700 states and 47468 transitions. [2023-12-15 22:51:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-15 22:51:48,207 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:48,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:48,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 22:51:48,208 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:48,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash -748390925, now seen corresponding path program 1 times [2023-12-15 22:51:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:48,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546770976] [2023-12-15 22:51:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:48,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:51:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 22:51:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 22:51:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 22:51:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 22:51:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 22:51:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 22:51:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 22:51:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-15 22:51:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:48,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:48,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546770976] [2023-12-15 22:51:48,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546770976] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:48,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:48,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:51:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341508040] [2023-12-15 22:51:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:48,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:51:48,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:51:48,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:51:48,294 INFO L87 Difference]: Start difference. First operand 27700 states and 47468 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:50,316 INFO L93 Difference]: Finished difference Result 75490 states and 131580 transitions. [2023-12-15 22:51:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:51:50,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2023-12-15 22:51:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:50,482 INFO L225 Difference]: With dead ends: 75490 [2023-12-15 22:51:50,483 INFO L226 Difference]: Without dead ends: 50670 [2023-12-15 22:51:50,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:50,652 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 1228 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:50,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 714 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 22:51:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50670 states. [2023-12-15 22:51:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50670 to 50524. [2023-12-15 22:51:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50524 states, 41963 states have (on average 1.6236446393251198) internal successors, (68133), 41970 states have internal predecessors, (68133), 8533 states have call successors, (8533), 23 states have call predecessors, (8533), 27 states have return successors, (9678), 8532 states have call predecessors, (9678), 8532 states have call successors, (9678) [2023-12-15 22:51:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50524 states to 50524 states and 86344 transitions. [2023-12-15 22:51:52,453 INFO L78 Accepts]: Start accepts. Automaton has 50524 states and 86344 transitions. Word has length 141 [2023-12-15 22:51:52,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:52,453 INFO L495 AbstractCegarLoop]: Abstraction has 50524 states and 86344 transitions. [2023-12-15 22:51:52,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 50524 states and 86344 transitions. [2023-12-15 22:51:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-15 22:51:52,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:52,513 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 22:51:52,514 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:52,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash 499773937, now seen corresponding path program 1 times [2023-12-15 22:51:52,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:52,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136105388] [2023-12-15 22:51:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:51:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:51:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:51:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:51:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:51:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:51:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:51:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 22:51:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 22:51:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 22:51:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 22:51:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 22:51:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-15 22:51:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-15 22:51:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-15 22:51:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:51:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:51:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:51:52,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:51:52,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136105388] [2023-12-15 22:51:52,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136105388] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:51:52,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:51:52,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:51:52,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671887785] [2023-12-15 22:51:52,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:51:52,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:51:52,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:51:52,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:51:52,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:51:52,588 INFO L87 Difference]: Start difference. First operand 50524 states and 86344 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:51:55,497 INFO L93 Difference]: Finished difference Result 94237 states and 164743 transitions. [2023-12-15 22:51:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:51:55,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2023-12-15 22:51:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:51:55,810 INFO L225 Difference]: With dead ends: 94237 [2023-12-15 22:51:55,810 INFO L226 Difference]: Without dead ends: 94050 [2023-12-15 22:51:55,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:51:55,843 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1228 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:51:55,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 714 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 22:51:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94050 states. [2023-12-15 22:51:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94050 to 93904. [2023-12-15 22:51:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93904 states, 78544 states have (on average 1.617233652475046) internal successors, (127024), 78551 states have internal predecessors, (127024), 15332 states have call successors, (15332), 23 states have call predecessors, (15332), 27 states have return successors, (17523), 15331 states have call predecessors, (17523), 15331 states have call successors, (17523) [2023-12-15 22:51:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93904 states to 93904 states and 159879 transitions. [2023-12-15 22:51:59,533 INFO L78 Accepts]: Start accepts. Automaton has 93904 states and 159879 transitions. Word has length 142 [2023-12-15 22:51:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:51:59,533 INFO L495 AbstractCegarLoop]: Abstraction has 93904 states and 159879 transitions. [2023-12-15 22:51:59,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 22:51:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 93904 states and 159879 transitions. [2023-12-15 22:51:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-15 22:51:59,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:51:59,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:51:59,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 22:51:59,693 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:51:59,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:51:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1921148146, now seen corresponding path program 1 times [2023-12-15 22:51:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:51:59,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181500859] [2023-12-15 22:51:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:51:59,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:51:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:52:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:52:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:52:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:52:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:52:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:52:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:52:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 22:52:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 22:52:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 22:52:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 22:52:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 22:52:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 22:52:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-15 22:52:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-15 22:52:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:52:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-15 22:52:00,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:52:00,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181500859] [2023-12-15 22:52:00,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181500859] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:52:00,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290998199] [2023-12-15 22:52:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:52:00,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:52:00,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:52:00,300 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:52:00,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 22:52:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:52:00,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-15 22:52:00,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:52:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 22:52:00,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:52:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-15 22:52:01,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290998199] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:52:01,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:52:01,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 32 [2023-12-15 22:52:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333751310] [2023-12-15 22:52:01,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:52:01,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-15 22:52:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:52:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-15 22:52:01,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2023-12-15 22:52:01,047 INFO L87 Difference]: Start difference. First operand 93904 states and 159879 transitions. Second operand has 32 states, 30 states have (on average 7.7) internal successors, (231), 24 states have internal predecessors, (231), 9 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (42), 11 states have call predecessors, (42), 9 states have call successors, (42) Received shutdown request... [2023-12-15 22:52:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2023-12-15 22:52:14,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10446 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3455, Invalid=26301, Unknown=0, NotChecked=0, Total=29756 [2023-12-15 22:52:14,590 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 5353 mSDsluCounter, 7203 mSDsCounter, 0 mSdLazyCounter, 19220 mSolverCounterSat, 1630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5377 SdHoareTripleChecker+Valid, 7591 SdHoareTripleChecker+Invalid, 20850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1630 IncrementalHoareTripleChecker+Valid, 19220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:52:14,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5377 Valid, 7591 Invalid, 20850 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1630 Valid, 19220 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-12-15 22:52:14,591 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:52:14,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-15 22:52:14,622 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 22:52:14,622 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 22:52:14,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:52:14,798 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (93904states) and FLOYD_HOARE automaton (currently 146 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (103898 states constructed, input type IntersectNwa). [2023-12-15 22:52:14,801 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:52:14,803 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:52:14,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:52:14 BoogieIcfgContainer [2023-12-15 22:52:14,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:52:14,804 INFO L158 Benchmark]: Toolchain (without parser) took 58343.13ms. Allocated memory was 311.4MB in the beginning and 4.7GB in the end (delta: 4.3GB). Free memory was 256.3MB in the beginning and 3.6GB in the end (delta: -3.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-15 22:52:14,805 INFO L158 Benchmark]: CDTParser took 15.76ms. Allocated memory is still 246.4MB. Free memory is still 196.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:52:14,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 685.83ms. Allocated memory is still 311.4MB. Free memory was 256.1MB in the beginning and 263.7MB in the end (delta: -7.5MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-15 22:52:14,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.51ms. Allocated memory is still 311.4MB. Free memory was 263.7MB in the beginning and 257.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-15 22:52:14,805 INFO L158 Benchmark]: Boogie Preprocessor took 66.50ms. Allocated memory is still 311.4MB. Free memory was 257.4MB in the beginning and 250.5MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-15 22:52:14,806 INFO L158 Benchmark]: RCFGBuilder took 992.64ms. Allocated memory is still 311.4MB. Free memory was 250.5MB in the beginning and 176.6MB in the end (delta: 73.9MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. [2023-12-15 22:52:14,806 INFO L158 Benchmark]: TraceAbstraction took 56509.20ms. Allocated memory was 311.4MB in the beginning and 4.7GB in the end (delta: 4.3GB). Free memory was 176.1MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-12-15 22:52:14,809 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 15.76ms. Allocated memory is still 246.4MB. Free memory is still 196.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 685.83ms. Allocated memory is still 311.4MB. Free memory was 256.1MB in the beginning and 263.7MB in the end (delta: -7.5MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.51ms. Allocated memory is still 311.4MB. Free memory was 263.7MB in the beginning and 257.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.50ms. Allocated memory is still 311.4MB. Free memory was 257.4MB in the beginning and 250.5MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 992.64ms. Allocated memory is still 311.4MB. Free memory was 250.5MB in the beginning and 176.6MB in the end (delta: 73.9MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. * TraceAbstraction took 56509.20ms. Allocated memory was 311.4MB in the beginning and 4.7GB in the end (delta: 4.3GB). Free memory was 176.1MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 48]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] - GenericResultAtLocation [Line: 363]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [363] - GenericResultAtLocation [Line: 383]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [383] - GenericResultAtLocation [Line: 392]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [392] - GenericResultAtLocation [Line: 764]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [764] - GenericResultAtLocation [Line: 1163]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1163] - GenericResultAtLocation [Line: 1529]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1529] - GenericResultAtLocation [Line: 1664]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1664] - GenericResultAtLocation [Line: 1681]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1681] - GenericResultAtLocation [Line: 1716]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1716] - GenericResultAtLocation [Line: 2783]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2783] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 388]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 388). Cancelled while NwaCegarLoop was constructing difference of abstraction (93904states) and FLOYD_HOARE automaton (currently 146 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (103898 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 24 procedures, 335 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.5s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 40.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25844 SdHoareTripleChecker+Valid, 25.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25602 mSDsluCounter, 27762 SdHoareTripleChecker+Invalid, 21.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22324 mSDsCounter, 9270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50695 IncrementalHoareTripleChecker+Invalid, 59965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9270 mSolverCounterUnsat, 5438 mSDtfsCounter, 50695 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2295 GetRequests, 1860 SyntacticMatches, 0 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10891 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93904occurred in iteration=21, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 2326 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 3724 NumberOfCodeBlocks, 3724 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3963 ConstructedInterpolants, 0 QuantifiedInterpolants, 6761 SizeOfPredicates, 12 NumberOfNonLiveVariables, 7703 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 31 InterpolantComputations, 20 PerfectInterpolantSequences, 1142/1182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown