./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_product19.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9deea958caebdff7c89a17deb67516eff149386872824a7682accca78686b765 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 17:39:17,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 17:39:17,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 17:39:17,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 17:39:17,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 17:39:17,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 17:39:17,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 17:39:17,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 17:39:17,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 17:39:17,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 17:39:17,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 17:39:17,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 17:39:17,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 17:39:17,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 17:39:17,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 17:39:17,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 17:39:17,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 17:39:17,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 17:39:17,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 17:39:17,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 17:39:17,976 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 17:39:17,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 17:39:17,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 17:39:17,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 17:39:17,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 17:39:17,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 17:39:17,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 17:39:17,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 17:39:17,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 17:39:17,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 17:39:17,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 17:39:17,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 17:39:17,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 17:39:17,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 17:39:17,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 17:39:17,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 17:39:17,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 17:39:17,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 17:39:17,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 17:39:17,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 17:39:17,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 17:39:17,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 17:39:17,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 17:39:18,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 17:39:18,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 17:39:18,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 17:39:18,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 17:39:18,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 17:39:18,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 17:39:18,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 17:39:18,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 17:39:18,022 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 17:39:18,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 17:39:18,023 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 17:39:18,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 17:39:18,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 17:39:18,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 17:39:18,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 17:39:18,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 17:39:18,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 17:39:18,024 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 17:39:18,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 17:39:18,025 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 17:39:18,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 17:39:18,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 17:39:18,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 17:39:18,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 17:39:18,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 17:39:18,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 17:39:18,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 17:39:18,026 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 17:39:18,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 17:39:18,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 17:39:18,027 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 17:39:18,027 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 17:39:18,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 17:39:18,027 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9deea958caebdff7c89a17deb67516eff149386872824a7682accca78686b765 [2022-07-13 17:39:18,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 17:39:18,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 17:39:18,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 17:39:18,235 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 17:39:18,235 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 17:39:18,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product19.cil.c [2022-07-13 17:39:18,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7875cb8/da8c13f90ebe45158105a2747356dfa8/FLAG27db0f576 [2022-07-13 17:39:18,733 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 17:39:18,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product19.cil.c [2022-07-13 17:39:18,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7875cb8/da8c13f90ebe45158105a2747356dfa8/FLAG27db0f576 [2022-07-13 17:39:18,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7875cb8/da8c13f90ebe45158105a2747356dfa8 [2022-07-13 17:39:18,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 17:39:18,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 17:39:18,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 17:39:18,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 17:39:18,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 17:39:18,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 05:39:18" (1/1) ... [2022-07-13 17:39:18,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e59e6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:18, skipping insertion in model container [2022-07-13 17:39:18,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 05:39:18" (1/1) ... [2022-07-13 17:39:18,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 17:39:18,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 17:39:19,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product19.cil.c[39319,39332] [2022-07-13 17:39:19,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 17:39:19,232 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 17:39:19,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product19.cil.c[39319,39332] [2022-07-13 17:39:19,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 17:39:19,329 INFO L208 MainTranslator]: Completed translation [2022-07-13 17:39:19,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19 WrapperNode [2022-07-13 17:39:19,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 17:39:19,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 17:39:19,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 17:39:19,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 17:39:19,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (1/1) ... [2022-07-13 17:39:19,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (1/1) ... [2022-07-13 17:39:19,428 INFO L137 Inliner]: procedures = 127, calls = 198, calls flagged for inlining = 60, calls inlined = 55, statements flattened = 992 [2022-07-13 17:39:19,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 17:39:19,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 17:39:19,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 17:39:19,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 17:39:19,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (1/1) ... [2022-07-13 17:39:19,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (1/1) ... [2022-07-13 17:39:19,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (1/1) ... [2022-07-13 17:39:19,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (1/1) ... [2022-07-13 17:39:19,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (1/1) ... [2022-07-13 17:39:19,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (1/1) ... [2022-07-13 17:39:19,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (1/1) ... [2022-07-13 17:39:19,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 17:39:19,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 17:39:19,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 17:39:19,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 17:39:19,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (1/1) ... [2022-07-13 17:39:19,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 17:39:19,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:39:19,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 17:39:19,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 17:39:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2022-07-13 17:39:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2022-07-13 17:39:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2022-07-13 17:39:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2022-07-13 17:39:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2022-07-13 17:39:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2022-07-13 17:39:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2022-07-13 17:39:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2022-07-13 17:39:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2022-07-13 17:39:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2022-07-13 17:39:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2022-07-13 17:39:19,554 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2022-07-13 17:39:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2022-07-13 17:39:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2022-07-13 17:39:19,554 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2022-07-13 17:39:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2022-07-13 17:39:19,554 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2022-07-13 17:39:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 17:39:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2022-07-13 17:39:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2022-07-13 17:39:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2022-07-13 17:39:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2022-07-13 17:39:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2022-07-13 17:39:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2022-07-13 17:39:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2022-07-13 17:39:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2022-07-13 17:39:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2022-07-13 17:39:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2022-07-13 17:39:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2022-07-13 17:39:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2022-07-13 17:39:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2022-07-13 17:39:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2022-07-13 17:39:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 17:39:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2022-07-13 17:39:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2022-07-13 17:39:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 17:39:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 17:39:19,752 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 17:39:19,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 17:39:20,275 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 17:39:20,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 17:39:20,286 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 17:39:20,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 05:39:20 BoogieIcfgContainer [2022-07-13 17:39:20,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 17:39:20,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 17:39:20,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 17:39:20,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 17:39:20,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 05:39:18" (1/3) ... [2022-07-13 17:39:20,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7748f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 05:39:20, skipping insertion in model container [2022-07-13 17:39:20,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:39:19" (2/3) ... [2022-07-13 17:39:20,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7748f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 05:39:20, skipping insertion in model container [2022-07-13 17:39:20,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 05:39:20" (3/3) ... [2022-07-13 17:39:20,294 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec0_product19.cil.c [2022-07-13 17:39:20,303 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 17:39:20,304 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 17:39:20,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 17:39:20,356 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=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6591c787, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44720625 [2022-07-13 17:39:20,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 17:39:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 241 states have (on average 1.5352697095435686) internal successors, (370), 243 states have internal predecessors, (370), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-13 17:39:20,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 17:39:20,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:20,393 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:20,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash -756518862, now seen corresponding path program 1 times [2022-07-13 17:39:20,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:20,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908810360] [2022-07-13 17:39:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 17:39:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 17:39:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 17:39:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 17:39:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 17:39:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 17:39:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 17:39:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 17:39:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 17:39:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 17:39:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 17:39:20,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:20,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908810360] [2022-07-13 17:39:20,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908810360] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 17:39:20,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326326140] [2022-07-13 17:39:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:20,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:39:20,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:39:20,819 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) [2022-07-13 17:39:20,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 17:39:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 17:39:21,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:39:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 17:39:21,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 17:39:21,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326326140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:21,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 17:39:21,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2022-07-13 17:39:21,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19844096] [2022-07-13 17:39:21,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:21,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 17:39:21,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:21,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 17:39:21,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 17:39:21,116 INFO L87 Difference]: Start difference. First operand has 301 states, 241 states have (on average 1.5352697095435686) internal successors, (370), 243 states have internal predecessors, (370), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:21,160 INFO L93 Difference]: Finished difference Result 448 states and 662 transitions. [2022-07-13 17:39:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 17:39:21,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2022-07-13 17:39:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:21,170 INFO L225 Difference]: With dead ends: 448 [2022-07-13 17:39:21,170 INFO L226 Difference]: Without dead ends: 294 [2022-07-13 17:39:21,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 17:39:21,177 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:21,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 17:39:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-13 17:39:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-07-13 17:39:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 235 states have (on average 1.5276595744680852) internal successors, (359), 236 states have internal predecessors, (359), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-13 17:39:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 442 transitions. [2022-07-13 17:39:21,221 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 442 transitions. Word has length 104 [2022-07-13 17:39:21,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:21,222 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 442 transitions. [2022-07-13 17:39:21,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 442 transitions. [2022-07-13 17:39:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 17:39:21,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:21,228 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:21,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 17:39:21,447 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 [2022-07-13 17:39:21,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2087935493, now seen corresponding path program 1 times [2022-07-13 17:39:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:21,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362158594] [2022-07-13 17:39:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 17:39:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 17:39:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 17:39:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 17:39:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 17:39:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 17:39:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 17:39:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 17:39:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 17:39:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 17:39:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 17:39:21,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:21,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362158594] [2022-07-13 17:39:21,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362158594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 17:39:21,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798267190] [2022-07-13 17:39:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:21,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:39:21,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:39:21,598 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) [2022-07-13 17:39:21,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 17:39:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:21,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 17:39:21,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:39:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 17:39:21,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 17:39:21,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798267190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:21,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 17:39:21,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-13 17:39:21,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919819582] [2022-07-13 17:39:21,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:21,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 17:39:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:21,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 17:39:21,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 17:39:21,873 INFO L87 Difference]: Start difference. First operand 294 states and 442 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:21,914 INFO L93 Difference]: Finished difference Result 438 states and 643 transitions. [2022-07-13 17:39:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 17:39:21,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-07-13 17:39:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:21,924 INFO L225 Difference]: With dead ends: 438 [2022-07-13 17:39:21,924 INFO L226 Difference]: Without dead ends: 297 [2022-07-13 17:39:21,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 17:39:21,926 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 1 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:21,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 878 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 17:39:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-13 17:39:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 296. [2022-07-13 17:39:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 237 states have (on average 1.5232067510548524) internal successors, (361), 238 states have internal predecessors, (361), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-13 17:39:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 444 transitions. [2022-07-13 17:39:21,944 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 444 transitions. Word has length 105 [2022-07-13 17:39:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:21,945 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 444 transitions. [2022-07-13 17:39:21,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 444 transitions. [2022-07-13 17:39:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-13 17:39:21,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:21,949 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] [2022-07-13 17:39:21,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 17:39:22,168 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 [2022-07-13 17:39:22,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:22,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash 681092572, now seen corresponding path program 1 times [2022-07-13 17:39:22,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:22,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051750937] [2022-07-13 17:39:22,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:22,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 17:39:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 17:39:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 17:39:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 17:39:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 17:39:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 17:39:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 17:39:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 17:39:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 17:39:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 17:39:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 17:39:22,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:22,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051750937] [2022-07-13 17:39:22,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051750937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 17:39:22,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239617930] [2022-07-13 17:39:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:22,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:39:22,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:39:22,295 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) [2022-07-13 17:39:22,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 17:39:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 17:39:22,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:39:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 17:39:22,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 17:39:22,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239617930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:22,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 17:39:22,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-13 17:39:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768204037] [2022-07-13 17:39:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:22,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 17:39:22,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:22,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 17:39:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 17:39:22,531 INFO L87 Difference]: Start difference. First operand 296 states and 444 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:22,558 INFO L93 Difference]: Finished difference Result 622 states and 947 transitions. [2022-07-13 17:39:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 17:39:22,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2022-07-13 17:39:22,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:22,561 INFO L225 Difference]: With dead ends: 622 [2022-07-13 17:39:22,561 INFO L226 Difference]: Without dead ends: 353 [2022-07-13 17:39:22,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 17:39:22,563 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 107 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:22,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 855 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 17:39:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-13 17:39:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 345. [2022-07-13 17:39:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 275 states have (on average 1.538181818181818) internal successors, (423), 276 states have internal predecessors, (423), 53 states have call successors, (53), 16 states have call predecessors, (53), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-07-13 17:39:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 528 transitions. [2022-07-13 17:39:22,593 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 528 transitions. Word has length 111 [2022-07-13 17:39:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:22,595 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 528 transitions. [2022-07-13 17:39:22,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 528 transitions. [2022-07-13 17:39:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 17:39:22,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:22,606 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] [2022-07-13 17:39:22,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 17:39:22,824 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 [2022-07-13 17:39:22,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:22,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:22,825 INFO L85 PathProgramCache]: Analyzing trace with hash 740763177, now seen corresponding path program 1 times [2022-07-13 17:39:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:22,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658529688] [2022-07-13 17:39:22,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:22,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 17:39:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 17:39:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 17:39:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 17:39:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 17:39:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 17:39:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 17:39:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 17:39:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 17:39:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 17:39:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 17:39:22,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:22,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658529688] [2022-07-13 17:39:22,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658529688] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 17:39:22,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293348750] [2022-07-13 17:39:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:22,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:39:22,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:39:22,957 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) [2022-07-13 17:39:22,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 17:39:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 17:39:23,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:39:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 17:39:23,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 17:39:23,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293348750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:23,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 17:39:23,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-13 17:39:23,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465836250] [2022-07-13 17:39:23,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:23,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 17:39:23,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:23,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 17:39:23,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-13 17:39:23,229 INFO L87 Difference]: Start difference. First operand 345 states and 528 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 17:39:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:23,274 INFO L93 Difference]: Finished difference Result 681 states and 1046 transitions. [2022-07-13 17:39:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 17:39:23,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2022-07-13 17:39:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:23,278 INFO L225 Difference]: With dead ends: 681 [2022-07-13 17:39:23,278 INFO L226 Difference]: Without dead ends: 347 [2022-07-13 17:39:23,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:23,280 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 125 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:23,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1587 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 17:39:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-13 17:39:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2022-07-13 17:39:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 276 states have (on average 1.536231884057971) internal successors, (424), 278 states have internal predecessors, (424), 53 states have call successors, (53), 16 states have call predecessors, (53), 17 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2022-07-13 17:39:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 531 transitions. [2022-07-13 17:39:23,296 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 531 transitions. Word has length 112 [2022-07-13 17:39:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:23,297 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 531 transitions. [2022-07-13 17:39:23,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 17:39:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 531 transitions. [2022-07-13 17:39:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-13 17:39:23,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:23,300 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 17:39:23,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 17:39:23,516 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 [2022-07-13 17:39:23,516 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash 704008068, now seen corresponding path program 1 times [2022-07-13 17:39:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:23,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624705786] [2022-07-13 17:39:23,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:23,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 17:39:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 17:39:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 17:39:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 17:39:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 17:39:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 17:39:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 17:39:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 17:39:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 17:39:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 17:39:23,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:23,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624705786] [2022-07-13 17:39:23,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624705786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 17:39:23,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352460455] [2022-07-13 17:39:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:23,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:39:23,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:39:23,656 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) [2022-07-13 17:39:23,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 17:39:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:23,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 17:39:23,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:39:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 17:39:23,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 17:39:23,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352460455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:23,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 17:39:23,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-13 17:39:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451868415] [2022-07-13 17:39:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:23,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 17:39:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 17:39:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-13 17:39:23,923 INFO L87 Difference]: Start difference. First operand 347 states and 531 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 17:39:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:23,968 INFO L93 Difference]: Finished difference Result 683 states and 1051 transitions. [2022-07-13 17:39:23,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 17:39:23,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2022-07-13 17:39:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:23,971 INFO L225 Difference]: With dead ends: 683 [2022-07-13 17:39:23,971 INFO L226 Difference]: Without dead ends: 349 [2022-07-13 17:39:23,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-13 17:39:23,973 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 124 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:23,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1576 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 17:39:23,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-13 17:39:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2022-07-13 17:39:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 277 states have (on average 1.5342960288808665) internal successors, (425), 280 states have internal predecessors, (425), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2022-07-13 17:39:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 537 transitions. [2022-07-13 17:39:23,986 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 537 transitions. Word has length 113 [2022-07-13 17:39:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:23,986 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 537 transitions. [2022-07-13 17:39:23,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 17:39:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 537 transitions. [2022-07-13 17:39:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-13 17:39:23,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:23,988 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] [2022-07-13 17:39:24,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 17:39:24,209 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 [2022-07-13 17:39:24,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash 857466609, now seen corresponding path program 1 times [2022-07-13 17:39:24,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:24,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55975411] [2022-07-13 17:39:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:24,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 17:39:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 17:39:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 17:39:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 17:39:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 17:39:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 17:39:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 17:39:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 17:39:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 17:39:24,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:24,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55975411] [2022-07-13 17:39:24,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55975411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:24,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:24,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 17:39:24,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055392908] [2022-07-13 17:39:24,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:24,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 17:39:24,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:24,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 17:39:24,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 17:39:24,306 INFO L87 Difference]: Start difference. First operand 349 states and 537 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 17:39:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:25,510 INFO L93 Difference]: Finished difference Result 843 states and 1294 transitions. [2022-07-13 17:39:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 17:39:25,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2022-07-13 17:39:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:25,513 INFO L225 Difference]: With dead ends: 843 [2022-07-13 17:39:25,513 INFO L226 Difference]: Without dead ends: 517 [2022-07-13 17:39:25,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-13 17:39:25,515 INFO L413 NwaCegarLoop]: 577 mSDtfsCounter, 1079 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:25,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 1391 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 17:39:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-13 17:39:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 349. [2022-07-13 17:39:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 277 states have (on average 1.5342960288808665) internal successors, (425), 280 states have internal predecessors, (425), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2022-07-13 17:39:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 536 transitions. [2022-07-13 17:39:25,534 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 536 transitions. Word has length 114 [2022-07-13 17:39:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:25,534 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 536 transitions. [2022-07-13 17:39:25,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 17:39:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 536 transitions. [2022-07-13 17:39:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 17:39:25,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:25,536 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] [2022-07-13 17:39:25,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 17:39:25,536 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:25,537 INFO L85 PathProgramCache]: Analyzing trace with hash 748732846, now seen corresponding path program 2 times [2022-07-13 17:39:25,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:25,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995611438] [2022-07-13 17:39:25,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:25,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 17:39:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 17:39:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 17:39:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 17:39:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 17:39:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 17:39:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 17:39:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 17:39:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 17:39:25,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:25,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995611438] [2022-07-13 17:39:25,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995611438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:25,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:25,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 17:39:25,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357884398] [2022-07-13 17:39:25,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:25,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 17:39:25,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:25,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 17:39:25,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 17:39:25,632 INFO L87 Difference]: Start difference. First operand 349 states and 536 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 17:39:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:26,856 INFO L93 Difference]: Finished difference Result 845 states and 1297 transitions. [2022-07-13 17:39:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 17:39:26,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2022-07-13 17:39:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:26,859 INFO L225 Difference]: With dead ends: 845 [2022-07-13 17:39:26,859 INFO L226 Difference]: Without dead ends: 519 [2022-07-13 17:39:26,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-13 17:39:26,860 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 1056 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:26,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1402 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 17:39:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-07-13 17:39:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 351. [2022-07-13 17:39:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 278 states have (on average 1.5323741007194245) internal successors, (426), 282 states have internal predecessors, (426), 53 states have call successors, (53), 16 states have call predecessors, (53), 19 states have return successors, (60), 52 states have call predecessors, (60), 52 states have call successors, (60) [2022-07-13 17:39:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 539 transitions. [2022-07-13 17:39:26,885 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 539 transitions. Word has length 115 [2022-07-13 17:39:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:26,886 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 539 transitions. [2022-07-13 17:39:26,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 17:39:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 539 transitions. [2022-07-13 17:39:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 17:39:26,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:26,887 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] [2022-07-13 17:39:26,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 17:39:26,888 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:26,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:26,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1183302676, now seen corresponding path program 1 times [2022-07-13 17:39:26,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:26,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806302939] [2022-07-13 17:39:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:26,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 17:39:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 17:39:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 17:39:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 17:39:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 17:39:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 17:39:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 17:39:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 17:39:26,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:26,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806302939] [2022-07-13 17:39:26,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806302939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:26,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:26,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 17:39:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388830420] [2022-07-13 17:39:26,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:26,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 17:39:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 17:39:26,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 17:39:26,982 INFO L87 Difference]: Start difference. First operand 351 states and 539 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 17:39:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:28,710 INFO L93 Difference]: Finished difference Result 843 states and 1292 transitions. [2022-07-13 17:39:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 17:39:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2022-07-13 17:39:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:28,713 INFO L225 Difference]: With dead ends: 843 [2022-07-13 17:39:28,713 INFO L226 Difference]: Without dead ends: 519 [2022-07-13 17:39:28,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-07-13 17:39:28,714 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 1171 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 3539 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 3951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 3539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:28,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1693 Invalid, 3951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 3539 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 17:39:28,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-07-13 17:39:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 351. [2022-07-13 17:39:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 278 states have (on average 1.5323741007194245) internal successors, (426), 282 states have internal predecessors, (426), 53 states have call successors, (53), 16 states have call predecessors, (53), 19 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2022-07-13 17:39:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 538 transitions. [2022-07-13 17:39:28,730 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 538 transitions. Word has length 116 [2022-07-13 17:39:28,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:28,730 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 538 transitions. [2022-07-13 17:39:28,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 17:39:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 538 transitions. [2022-07-13 17:39:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 17:39:28,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:28,732 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] [2022-07-13 17:39:28,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 17:39:28,732 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:28,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash 158463807, now seen corresponding path program 2 times [2022-07-13 17:39:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:28,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972165057] [2022-07-13 17:39:28,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 17:39:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 17:39:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 17:39:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 17:39:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 17:39:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 17:39:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 17:39:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 17:39:28,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972165057] [2022-07-13 17:39:28,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972165057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:28,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:28,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 17:39:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374317276] [2022-07-13 17:39:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:28,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 17:39:28,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:28,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 17:39:28,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 17:39:28,847 INFO L87 Difference]: Start difference. First operand 351 states and 538 transitions. Second operand has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 17:39:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:30,542 INFO L93 Difference]: Finished difference Result 845 states and 1298 transitions. [2022-07-13 17:39:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 17:39:30,542 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 117 [2022-07-13 17:39:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:30,550 INFO L225 Difference]: With dead ends: 845 [2022-07-13 17:39:30,551 INFO L226 Difference]: Without dead ends: 521 [2022-07-13 17:39:30,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-07-13 17:39:30,552 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 1204 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 3444 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 3855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 3444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:30,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 1676 Invalid, 3855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 3444 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 17:39:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-07-13 17:39:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 353. [2022-07-13 17:39:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 279 states have (on average 1.5304659498207884) internal successors, (427), 284 states have internal predecessors, (427), 53 states have call successors, (53), 16 states have call predecessors, (53), 20 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2022-07-13 17:39:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 544 transitions. [2022-07-13 17:39:30,570 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 544 transitions. Word has length 117 [2022-07-13 17:39:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:30,571 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 544 transitions. [2022-07-13 17:39:30,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 17:39:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 544 transitions. [2022-07-13 17:39:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 17:39:30,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:30,574 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] [2022-07-13 17:39:30,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 17:39:30,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1021608935, now seen corresponding path program 1 times [2022-07-13 17:39:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:30,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577775716] [2022-07-13 17:39:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 17:39:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 17:39:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 17:39:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 17:39:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 17:39:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 17:39:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 17:39:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:30,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:30,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577775716] [2022-07-13 17:39:30,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577775716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 17:39:30,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967401679] [2022-07-13 17:39:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:30,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:39:30,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:39:30,666 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) [2022-07-13 17:39:30,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 17:39:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:30,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 17:39:30,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:39:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:30,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 17:39:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:30,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967401679] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 17:39:30,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 17:39:30,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2022-07-13 17:39:30,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974485042] [2022-07-13 17:39:30,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 17:39:30,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 17:39:30,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:30,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 17:39:30,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-13 17:39:30,945 INFO L87 Difference]: Start difference. First operand 353 states and 544 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-13 17:39:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:32,512 INFO L93 Difference]: Finished difference Result 1014 states and 1626 transitions. [2022-07-13 17:39:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 17:39:32,512 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 118 [2022-07-13 17:39:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:32,519 INFO L225 Difference]: With dead ends: 1014 [2022-07-13 17:39:32,519 INFO L226 Difference]: Without dead ends: 873 [2022-07-13 17:39:32,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-07-13 17:39:32,520 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 1288 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:32,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 1776 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 17:39:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-07-13 17:39:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 681. [2022-07-13 17:39:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 543 states have (on average 1.5930018416206262) internal successors, (865), 548 states have internal predecessors, (865), 117 states have call successors, (117), 16 states have call predecessors, (117), 20 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2022-07-13 17:39:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1120 transitions. [2022-07-13 17:39:32,554 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1120 transitions. Word has length 118 [2022-07-13 17:39:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:32,554 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 1120 transitions. [2022-07-13 17:39:32,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-13 17:39:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1120 transitions. [2022-07-13 17:39:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 17:39:32,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:32,557 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:32,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 17:39:32,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:39:32,772 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:32,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:32,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1951274134, now seen corresponding path program 1 times [2022-07-13 17:39:32,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:32,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984772896] [2022-07-13 17:39:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 17:39:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 17:39:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 17:39:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 17:39:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 17:39:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 17:39:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 17:39:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:32,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:32,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984772896] [2022-07-13 17:39:32,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984772896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:32,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:32,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 17:39:32,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414524852] [2022-07-13 17:39:32,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:32,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 17:39:32,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:32,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 17:39:32,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:39:32,857 INFO L87 Difference]: Start difference. First operand 681 states and 1120 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:33,820 INFO L93 Difference]: Finished difference Result 1795 states and 2997 transitions. [2022-07-13 17:39:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 17:39:33,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2022-07-13 17:39:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:33,825 INFO L225 Difference]: With dead ends: 1795 [2022-07-13 17:39:33,826 INFO L226 Difference]: Without dead ends: 1182 [2022-07-13 17:39:33,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:33,828 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1097 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:33,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1264 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 17:39:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2022-07-13 17:39:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1006. [2022-07-13 17:39:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 804 states have (on average 1.6044776119402986) internal successors, (1290), 809 states have internal predecessors, (1290), 181 states have call successors, (181), 16 states have call predecessors, (181), 20 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2022-07-13 17:39:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1683 transitions. [2022-07-13 17:39:33,895 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1683 transitions. Word has length 124 [2022-07-13 17:39:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:33,895 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1683 transitions. [2022-07-13 17:39:33,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1683 transitions. [2022-07-13 17:39:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-13 17:39:33,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:33,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:33,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 17:39:33,900 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash 681143198, now seen corresponding path program 1 times [2022-07-13 17:39:33,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:33,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638797057] [2022-07-13 17:39:33,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:33,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 17:39:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 17:39:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 17:39:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 17:39:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 17:39:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 17:39:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 17:39:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:33,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:33,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638797057] [2022-07-13 17:39:33,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638797057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:33,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:33,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 17:39:33,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33611261] [2022-07-13 17:39:33,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:33,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 17:39:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:33,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 17:39:33,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:39:33,964 INFO L87 Difference]: Start difference. First operand 1006 states and 1683 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:34,938 INFO L93 Difference]: Finished difference Result 2575 states and 4346 transitions. [2022-07-13 17:39:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 17:39:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2022-07-13 17:39:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:34,946 INFO L225 Difference]: With dead ends: 2575 [2022-07-13 17:39:34,946 INFO L226 Difference]: Without dead ends: 1690 [2022-07-13 17:39:34,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:34,949 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 1078 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:34,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 1224 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 17:39:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2022-07-13 17:39:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1514. [2022-07-13 17:39:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1217 states have (on average 1.6113393590797043) internal successors, (1961), 1222 states have internal predecessors, (1961), 276 states have call successors, (276), 16 states have call predecessors, (276), 20 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2022-07-13 17:39:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2544 transitions. [2022-07-13 17:39:35,012 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2544 transitions. Word has length 125 [2022-07-13 17:39:35,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:35,013 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 2544 transitions. [2022-07-13 17:39:35,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2544 transitions. [2022-07-13 17:39:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-13 17:39:35,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:35,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:35,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 17:39:35,020 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:35,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash -64126520, now seen corresponding path program 1 times [2022-07-13 17:39:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:35,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578155952] [2022-07-13 17:39:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 17:39:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 17:39:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 17:39:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 17:39:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 17:39:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 17:39:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 17:39:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:35,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:35,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578155952] [2022-07-13 17:39:35,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578155952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:35,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:35,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 17:39:35,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918982899] [2022-07-13 17:39:35,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:35,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 17:39:35,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:35,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 17:39:35,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:39:35,088 INFO L87 Difference]: Start difference. First operand 1514 states and 2544 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:36,103 INFO L93 Difference]: Finished difference Result 3727 states and 6355 transitions. [2022-07-13 17:39:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 17:39:36,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2022-07-13 17:39:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:36,112 INFO L225 Difference]: With dead ends: 3727 [2022-07-13 17:39:36,112 INFO L226 Difference]: Without dead ends: 2459 [2022-07-13 17:39:36,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:36,116 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 1068 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:36,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1234 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 17:39:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2022-07-13 17:39:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2283. [2022-07-13 17:39:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 1863 states have (on average 1.6167471819645733) internal successors, (3012), 1868 states have internal predecessors, (3012), 399 states have call successors, (399), 16 states have call predecessors, (399), 20 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2022-07-13 17:39:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3857 transitions. [2022-07-13 17:39:36,197 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3857 transitions. Word has length 126 [2022-07-13 17:39:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:36,197 INFO L495 AbstractCegarLoop]: Abstraction has 2283 states and 3857 transitions. [2022-07-13 17:39:36,198 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3857 transitions. [2022-07-13 17:39:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 17:39:36,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:36,206 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:36,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 17:39:36,206 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash -793686243, now seen corresponding path program 1 times [2022-07-13 17:39:36,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:36,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375356743] [2022-07-13 17:39:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:36,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 17:39:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 17:39:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 17:39:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 17:39:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 17:39:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 17:39:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 17:39:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:36,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:36,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375356743] [2022-07-13 17:39:36,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375356743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:36,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:36,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 17:39:36,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119275045] [2022-07-13 17:39:36,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:36,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 17:39:36,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:36,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 17:39:36,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:39:36,274 INFO L87 Difference]: Start difference. First operand 2283 states and 3857 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:37,348 INFO L93 Difference]: Finished difference Result 5521 states and 9489 transitions. [2022-07-13 17:39:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 17:39:37,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2022-07-13 17:39:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:37,362 INFO L225 Difference]: With dead ends: 5521 [2022-07-13 17:39:37,362 INFO L226 Difference]: Without dead ends: 3688 [2022-07-13 17:39:37,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:37,367 INFO L413 NwaCegarLoop]: 599 mSDtfsCounter, 1070 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:37,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1231 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 17:39:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2022-07-13 17:39:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3512. [2022-07-13 17:39:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 2913 states have (on average 1.619979402677652) internal successors, (4719), 2918 states have internal predecessors, (4719), 578 states have call successors, (578), 16 states have call predecessors, (578), 20 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2022-07-13 17:39:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5948 transitions. [2022-07-13 17:39:37,524 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5948 transitions. Word has length 127 [2022-07-13 17:39:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:37,525 INFO L495 AbstractCegarLoop]: Abstraction has 3512 states and 5948 transitions. [2022-07-13 17:39:37,525 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5948 transitions. [2022-07-13 17:39:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 17:39:37,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:37,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:37,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 17:39:37,536 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1926920396, now seen corresponding path program 1 times [2022-07-13 17:39:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:37,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250011135] [2022-07-13 17:39:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:37,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 17:39:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 17:39:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 17:39:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 17:39:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 17:39:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 17:39:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 17:39:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:37,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:37,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250011135] [2022-07-13 17:39:37,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250011135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:37,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:37,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 17:39:37,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105109489] [2022-07-13 17:39:37,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:37,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 17:39:37,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:37,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 17:39:37,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:39:37,616 INFO L87 Difference]: Start difference. First operand 3512 states and 5948 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:38,654 INFO L93 Difference]: Finished difference Result 8469 states and 14636 transitions. [2022-07-13 17:39:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 17:39:38,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2022-07-13 17:39:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:38,709 INFO L225 Difference]: With dead ends: 8469 [2022-07-13 17:39:38,709 INFO L226 Difference]: Without dead ends: 5719 [2022-07-13 17:39:38,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:38,717 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 1088 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:38,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1254 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 17:39:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2022-07-13 17:39:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 5543. [2022-07-13 17:39:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5543 states, 4568 states have (on average 1.6136164623467601) internal successors, (7371), 4573 states have internal predecessors, (7371), 954 states have call successors, (954), 16 states have call predecessors, (954), 20 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2022-07-13 17:39:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 9396 transitions. [2022-07-13 17:39:39,005 INFO L78 Accepts]: Start accepts. Automaton has 5543 states and 9396 transitions. Word has length 128 [2022-07-13 17:39:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:39,006 INFO L495 AbstractCegarLoop]: Abstraction has 5543 states and 9396 transitions. [2022-07-13 17:39:39,006 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5543 states and 9396 transitions. [2022-07-13 17:39:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 17:39:39,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:39,021 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:39,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 17:39:39,021 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1737890841, now seen corresponding path program 1 times [2022-07-13 17:39:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:39,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114100367] [2022-07-13 17:39:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 17:39:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 17:39:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 17:39:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 17:39:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 17:39:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 17:39:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 17:39:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:39,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114100367] [2022-07-13 17:39:39,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114100367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:39,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:39,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 17:39:39,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931066721] [2022-07-13 17:39:39,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:39,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 17:39:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:39,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 17:39:39,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:39:39,098 INFO L87 Difference]: Start difference. First operand 5543 states and 9396 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:40,279 INFO L93 Difference]: Finished difference Result 13806 states and 23857 transitions. [2022-07-13 17:39:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 17:39:40,279 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2022-07-13 17:39:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:40,313 INFO L225 Difference]: With dead ends: 13806 [2022-07-13 17:39:40,313 INFO L226 Difference]: Without dead ends: 9402 [2022-07-13 17:39:40,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:40,336 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 1059 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:40,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1242 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 17:39:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9402 states. [2022-07-13 17:39:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9402 to 9226. [2022-07-13 17:39:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9226 states, 7645 states have (on average 1.6111183780248528) internal successors, (12317), 7650 states have internal predecessors, (12317), 1560 states have call successors, (1560), 16 states have call predecessors, (1560), 20 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2022-07-13 17:39:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9226 states to 9226 states and 15632 transitions. [2022-07-13 17:39:40,726 INFO L78 Accepts]: Start accepts. Automaton has 9226 states and 15632 transitions. Word has length 129 [2022-07-13 17:39:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:40,726 INFO L495 AbstractCegarLoop]: Abstraction has 9226 states and 15632 transitions. [2022-07-13 17:39:40,726 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 9226 states and 15632 transitions. [2022-07-13 17:39:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 17:39:40,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:40,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:40,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 17:39:40,744 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash 294042718, now seen corresponding path program 1 times [2022-07-13 17:39:40,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:40,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557024200] [2022-07-13 17:39:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 17:39:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 17:39:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 17:39:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 17:39:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 17:39:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 17:39:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 17:39:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:40,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:40,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557024200] [2022-07-13 17:39:40,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557024200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:40,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:40,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 17:39:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284481523] [2022-07-13 17:39:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:40,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 17:39:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:40,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 17:39:40,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:39:40,808 INFO L87 Difference]: Start difference. First operand 9226 states and 15632 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:42,195 INFO L93 Difference]: Finished difference Result 23990 states and 41403 transitions. [2022-07-13 17:39:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 17:39:42,195 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2022-07-13 17:39:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:42,245 INFO L225 Difference]: With dead ends: 23990 [2022-07-13 17:39:42,246 INFO L226 Difference]: Without dead ends: 16355 [2022-07-13 17:39:42,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:42,269 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 1041 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:42,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1266 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 17:39:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16355 states. [2022-07-13 17:39:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16355 to 16179. [2022-07-13 17:39:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16179 states, 13395 states have (on average 1.6020156774916015) internal successors, (21459), 13400 states have internal predecessors, (21459), 2763 states have call successors, (2763), 16 states have call predecessors, (2763), 20 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2022-07-13 17:39:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16179 states to 16179 states and 27324 transitions. [2022-07-13 17:39:42,937 INFO L78 Accepts]: Start accepts. Automaton has 16179 states and 27324 transitions. Word has length 130 [2022-07-13 17:39:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:42,938 INFO L495 AbstractCegarLoop]: Abstraction has 16179 states and 27324 transitions. [2022-07-13 17:39:42,938 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 16179 states and 27324 transitions. [2022-07-13 17:39:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-13 17:39:42,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:42,962 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:42,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 17:39:42,963 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash -624018824, now seen corresponding path program 1 times [2022-07-13 17:39:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:42,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844149650] [2022-07-13 17:39:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:42,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 17:39:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 17:39:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 17:39:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 17:39:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 17:39:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 17:39:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 17:39:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:43,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844149650] [2022-07-13 17:39:43,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844149650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:43,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:43,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 17:39:43,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915778370] [2022-07-13 17:39:43,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:43,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 17:39:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:43,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 17:39:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:39:43,044 INFO L87 Difference]: Start difference. First operand 16179 states and 27324 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:44,993 INFO L93 Difference]: Finished difference Result 42956 states and 74002 transitions. [2022-07-13 17:39:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 17:39:44,994 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2022-07-13 17:39:44,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:45,098 INFO L225 Difference]: With dead ends: 42956 [2022-07-13 17:39:45,098 INFO L226 Difference]: Without dead ends: 29010 [2022-07-13 17:39:45,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:45,135 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 1060 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:45,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1235 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 17:39:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29010 states. [2022-07-13 17:39:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29010 to 28834. [2022-07-13 17:39:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28834 states, 24011 states have (on average 1.5977260422306443) internal successors, (38363), 24016 states have internal predecessors, (38363), 4802 states have call successors, (4802), 16 states have call predecessors, (4802), 20 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2022-07-13 17:39:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28834 states to 28834 states and 48580 transitions. [2022-07-13 17:39:46,471 INFO L78 Accepts]: Start accepts. Automaton has 28834 states and 48580 transitions. Word has length 131 [2022-07-13 17:39:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:46,471 INFO L495 AbstractCegarLoop]: Abstraction has 28834 states and 48580 transitions. [2022-07-13 17:39:46,472 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 28834 states and 48580 transitions. [2022-07-13 17:39:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-13 17:39:46,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:46,499 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:46,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 17:39:46,500 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:46,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1114295804, now seen corresponding path program 1 times [2022-07-13 17:39:46,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:46,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356872496] [2022-07-13 17:39:46,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 17:39:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 17:39:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 17:39:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 17:39:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 17:39:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 17:39:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 17:39:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:46,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:46,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356872496] [2022-07-13 17:39:46,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356872496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:46,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:46,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 17:39:46,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974738860] [2022-07-13 17:39:46,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:46,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 17:39:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:46,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 17:39:46,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:39:46,579 INFO L87 Difference]: Start difference. First operand 28834 states and 48580 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:49,238 INFO L93 Difference]: Finished difference Result 78718 states and 134761 transitions. [2022-07-13 17:39:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 17:39:49,238 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2022-07-13 17:39:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:49,431 INFO L225 Difference]: With dead ends: 78718 [2022-07-13 17:39:49,431 INFO L226 Difference]: Without dead ends: 52889 [2022-07-13 17:39:49,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:49,501 INFO L413 NwaCegarLoop]: 606 mSDtfsCounter, 1056 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:49,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 1247 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 17:39:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52889 states. [2022-07-13 17:39:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52889 to 52713. [2022-07-13 17:39:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52713 states, 44175 states have (on average 1.5921222410865874) internal successors, (70332), 44180 states have internal predecessors, (70332), 8517 states have call successors, (8517), 16 states have call predecessors, (8517), 20 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2022-07-13 17:39:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52713 states to 52713 states and 88511 transitions. [2022-07-13 17:39:51,997 INFO L78 Accepts]: Start accepts. Automaton has 52713 states and 88511 transitions. Word has length 132 [2022-07-13 17:39:51,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:39:51,997 INFO L495 AbstractCegarLoop]: Abstraction has 52713 states and 88511 transitions. [2022-07-13 17:39:51,997 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 52713 states and 88511 transitions. [2022-07-13 17:39:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-13 17:39:52,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:39:52,031 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:39:52,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 17:39:52,032 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:39:52,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:39:52,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1436802920, now seen corresponding path program 1 times [2022-07-13 17:39:52,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:39:52,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576235110] [2022-07-13 17:39:52,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:39:52,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:39:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:39:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:39:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:39:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:39:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:39:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:39:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 17:39:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 17:39:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 17:39:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 17:39:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 17:39:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 17:39:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 17:39:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:39:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 17:39:52,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:39:52,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576235110] [2022-07-13 17:39:52,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576235110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:39:52,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:39:52,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 17:39:52,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090125049] [2022-07-13 17:39:52,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:39:52,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 17:39:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:39:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 17:39:52,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:39:52,103 INFO L87 Difference]: Start difference. First operand 52713 states and 88511 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:39:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:39:55,922 INFO L93 Difference]: Finished difference Result 98489 states and 168948 transitions. [2022-07-13 17:39:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 17:39:55,923 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2022-07-13 17:39:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:39:56,295 INFO L225 Difference]: With dead ends: 98489 [2022-07-13 17:39:56,295 INFO L226 Difference]: Without dead ends: 98348 [2022-07-13 17:39:56,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-13 17:39:56,332 INFO L413 NwaCegarLoop]: 595 mSDtfsCounter, 1061 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 17:39:56,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 1228 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 17:39:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98348 states. [2022-07-13 17:40:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98348 to 98172. [2022-07-13 17:40:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98172 states, 82835 states have (on average 1.585102915434297) internal successors, (131302), 82840 states have internal predecessors, (131302), 15316 states have call successors, (15316), 16 states have call predecessors, (15316), 20 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2022-07-13 17:40:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98172 states to 98172 states and 164125 transitions. [2022-07-13 17:40:00,802 INFO L78 Accepts]: Start accepts. Automaton has 98172 states and 164125 transitions. Word has length 133 [2022-07-13 17:40:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:40:00,802 INFO L495 AbstractCegarLoop]: Abstraction has 98172 states and 164125 transitions. [2022-07-13 17:40:00,802 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 17:40:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 98172 states and 164125 transitions. [2022-07-13 17:40:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 17:40:00,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:40:00,841 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:40:00,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 17:40:00,841 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:40:00,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:40:00,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1777075171, now seen corresponding path program 1 times [2022-07-13 17:40:00,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:40:00,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440611383] [2022-07-13 17:40:00,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:40:00,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:40:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 17:40:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 17:40:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 17:40:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 17:40:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 17:40:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 17:40:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 17:40:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 17:40:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 17:40:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 17:40:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 17:40:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 17:40:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 17:40:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 17:40:00,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:40:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440611383] [2022-07-13 17:40:00,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440611383] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 17:40:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781896317] [2022-07-13 17:40:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:40:00,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:40:00,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:40:00,939 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) [2022-07-13 17:40:00,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 17:40:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:40:01,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 17:40:01,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:40:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 17:40:01,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 17:40:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 17:40:01,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781896317] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 17:40:01,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 17:40:01,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2022-07-13 17:40:01,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940363698] [2022-07-13 17:40:01,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 17:40:01,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 17:40:01,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:40:01,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 17:40:01,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2022-07-13 17:40:01,475 INFO L87 Difference]: Start difference. First operand 98172 states and 164125 transitions. Second operand has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 18 states have internal predecessors, (222), 4 states have call successors, (42), 10 states have call predecessors, (42), 8 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35) [2022-07-13 17:40:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:40:13,009 INFO L93 Difference]: Finished difference Result 197054 states and 340208 transitions. [2022-07-13 17:40:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-13 17:40:13,009 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 18 states have internal predecessors, (222), 4 states have call successors, (42), 10 states have call predecessors, (42), 8 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35) Word has length 134 [2022-07-13 17:40:13,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:40:14,000 INFO L225 Difference]: With dead ends: 197054 [2022-07-13 17:40:14,000 INFO L226 Difference]: Without dead ends: 196919 [2022-07-13 17:40:14,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=916, Invalid=4196, Unknown=0, NotChecked=0, Total=5112 [2022-07-13 17:40:14,079 INFO L413 NwaCegarLoop]: 755 mSDtfsCounter, 4143 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 9155 mSolverCounterSat, 1681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4143 SdHoareTripleChecker+Valid, 2865 SdHoareTripleChecker+Invalid, 10836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1681 IncrementalHoareTripleChecker+Valid, 9155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-13 17:40:14,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4143 Valid, 2865 Invalid, 10836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1681 Valid, 9155 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-13 17:40:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196919 states. [2022-07-13 17:40:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196919 to 196345. [2022-07-13 17:40:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196345 states, 165673 states have (on average 1.5851104283739657) internal successors, (262610), 165680 states have internal predecessors, (262610), 30630 states have call successors, (30630), 34 states have call predecessors, (30630), 41 states have return successors, (37192), 30630 states have call predecessors, (37192), 30628 states have call successors, (37192)