./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 00:25:52,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 00:25:52,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 00:25:52,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 00:25:52,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 00:25:52,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 00:25:52,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 00:25:52,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 00:25:52,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 00:25:52,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 00:25:52,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 00:25:52,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 00:25:52,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 00:25:52,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 00:25:52,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 00:25:52,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 00:25:52,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 00:25:52,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 00:25:52,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 00:25:52,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 00:25:52,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 00:25:52,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 00:25:52,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 00:25:52,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 00:25:52,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 00:25:52,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 00:25:52,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 00:25:52,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 00:25:52,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 00:25:52,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 00:25:52,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 00:25:52,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 00:25:52,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 00:25:52,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 00:25:52,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 00:25:52,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 00:25:52,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 00:25:52,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 00:25:52,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 00:25:52,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 00:25:52,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 00:25:52,759 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 00:25:52,776 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 00:25:52,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 00:25:52,776 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 00:25:52,777 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 00:25:52,777 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 00:25:52,777 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 00:25:52,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 00:25:52,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 00:25:52,778 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 00:25:52,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 00:25:52,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 00:25:52,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 00:25:52,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 00:25:52,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 00:25:52,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 00:25:52,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 00:25:52,783 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 00:25:52,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 00:25:52,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 00:25:52,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 00:25:52,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 00:25:52,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:25:52,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 00:25:52,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 00:25:52,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 00:25:52,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 00:25:52,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 00:25:52,785 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 00:25:52,785 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 00:25:52,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 00:25:52,786 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 00:25:52,786 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 [2021-11-17 00:25:52,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 00:25:53,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 00:25:53,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 00:25:53,020 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 00:25:53,023 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 00:25:53,025 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2021-11-17 00:25:53,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0244977/96f657231d744f23b10b4d176b39a9b2/FLAG7d4098b4f [2021-11-17 00:25:53,697 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 00:25:53,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2021-11-17 00:25:53,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0244977/96f657231d744f23b10b4d176b39a9b2/FLAG7d4098b4f [2021-11-17 00:25:54,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0244977/96f657231d744f23b10b4d176b39a9b2 [2021-11-17 00:25:54,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 00:25:54,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 00:25:54,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 00:25:54,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 00:25:54,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 00:25:54,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:25:54" (1/1) ... [2021-11-17 00:25:54,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a65def3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:54, skipping insertion in model container [2021-11-17 00:25:54,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:25:54" (1/1) ... [2021-11-17 00:25:54,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 00:25:54,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 00:25:54,793 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/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2021-11-17 00:25:55,067 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:25:55,100 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 00:25:55,197 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/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2021-11-17 00:25:55,308 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:25:55,361 INFO L208 MainTranslator]: Completed translation [2021-11-17 00:25:55,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55 WrapperNode [2021-11-17 00:25:55,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 00:25:55,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 00:25:55,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 00:25:55,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 00:25:55,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (1/1) ... [2021-11-17 00:25:55,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (1/1) ... [2021-11-17 00:25:55,484 INFO L137 Inliner]: procedures = 165, calls = 691, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1767 [2021-11-17 00:25:55,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 00:25:55,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 00:25:55,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 00:25:55,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 00:25:55,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (1/1) ... [2021-11-17 00:25:55,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (1/1) ... [2021-11-17 00:25:55,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (1/1) ... [2021-11-17 00:25:55,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (1/1) ... [2021-11-17 00:25:55,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (1/1) ... [2021-11-17 00:25:55,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (1/1) ... [2021-11-17 00:25:55,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (1/1) ... [2021-11-17 00:25:55,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 00:25:55,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 00:25:55,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 00:25:55,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 00:25:55,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (1/1) ... [2021-11-17 00:25:55,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:25:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:25:55,655 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) [2021-11-17 00:25:55,676 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 [2021-11-17 00:25:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2021-11-17 00:25:55,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2021-11-17 00:25:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 00:25:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_8 [2021-11-17 00:25:55,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_8 [2021-11-17 00:25:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2021-11-17 00:25:55,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2021-11-17 00:25:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2021-11-17 00:25:55,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2021-11-17 00:25:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 00:25:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 00:25:55,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 00:25:55,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 00:25:55,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 00:25:55,698 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-11-17 00:25:55,698 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-11-17 00:25:55,698 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2021-11-17 00:25:55,698 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2021-11-17 00:25:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2021-11-17 00:25:55,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2021-11-17 00:25:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2021-11-17 00:25:55,699 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2021-11-17 00:25:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2021-11-17 00:25:55,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2021-11-17 00:25:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 00:25:55,700 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 00:25:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-11-17 00:25:55,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-11-17 00:25:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 00:25:55,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 00:25:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2021-11-17 00:25:55,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2021-11-17 00:25:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2021-11-17 00:25:55,701 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2021-11-17 00:25:55,701 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 00:25:55,701 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 00:25:55,701 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_disconnect [2021-11-17 00:25:55,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_disconnect [2021-11-17 00:25:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx_timeout [2021-11-17 00:25:55,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx_timeout [2021-11-17 00:25:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 00:25:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 00:25:55,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 00:25:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 00:25:55,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 00:25:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 00:25:55,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 00:25:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_set [2021-11-17 00:25:55,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_set [2021-11-17 00:25:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-11-17 00:25:55,704 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-11-17 00:25:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 00:25:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2021-11-17 00:25:55,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2021-11-17 00:25:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 00:25:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 00:25:55,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 00:25:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_free_urbs [2021-11-17 00:25:55,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_free_urbs [2021-11-17 00:25:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 00:25:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 00:25:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 00:25:55,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 00:25:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-11-17 00:25:55,707 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-11-17 00:25:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2021-11-17 00:25:55,707 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2021-11-17 00:25:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 00:25:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2021-11-17 00:25:55,708 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2021-11-17 00:25:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 00:25:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 00:25:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2021-11-17 00:25:55,709 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2021-11-17 00:25:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-11-17 00:25:55,709 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-11-17 00:25:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-11-17 00:25:55,709 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-11-17 00:25:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2021-11-17 00:25:55,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2021-11-17 00:25:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 00:25:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2021-11-17 00:25:55,710 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2021-11-17 00:25:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 00:25:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 00:25:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 00:25:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2021-11-17 00:25:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2021-11-17 00:25:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 00:25:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 00:25:56,156 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 00:25:56,160 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 00:25:56,331 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 00:25:56,630 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2021-11-17 00:25:57,144 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 00:25:57,162 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 00:25:57,162 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-17 00:25:57,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:25:57 BoogieIcfgContainer [2021-11-17 00:25:57,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 00:25:57,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 00:25:57,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 00:25:57,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 00:25:57,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:25:54" (1/3) ... [2021-11-17 00:25:57,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c04f79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:25:57, skipping insertion in model container [2021-11-17 00:25:57,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:55" (2/3) ... [2021-11-17 00:25:57,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c04f79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:25:57, skipping insertion in model container [2021-11-17 00:25:57,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:25:57" (3/3) ... [2021-11-17 00:25:57,174 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2021-11-17 00:25:57,178 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 00:25:57,178 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 00:25:57,232 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 00:25:57,246 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 00:25:57,246 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 00:25:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 527 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 405 states have internal predecessors, (503), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2021-11-17 00:25:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-17 00:25:57,306 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:57,306 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:25:57,307 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:57,315 INFO L85 PathProgramCache]: Analyzing trace with hash -60987296, now seen corresponding path program 1 times [2021-11-17 00:25:57,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:57,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874934707] [2021-11-17 00:25:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:57,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:57,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:57,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:25:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:57,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:25:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 00:25:57,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:57,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874934707] [2021-11-17 00:25:57,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874934707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:57,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:57,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 00:25:57,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518947837] [2021-11-17 00:25:57,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:57,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:25:57,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:57,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:25:57,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:25:57,728 INFO L87 Difference]: Start difference. First operand has 527 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 405 states have internal predecessors, (503), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:25:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:59,086 INFO L93 Difference]: Finished difference Result 1626 states and 2252 transitions. [2021-11-17 00:25:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:25:59,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2021-11-17 00:25:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:59,107 INFO L225 Difference]: With dead ends: 1626 [2021-11-17 00:25:59,107 INFO L226 Difference]: Without dead ends: 1080 [2021-11-17 00:25:59,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:25:59,116 INFO L933 BasicCegarLoop]: 719 mSDtfsCounter, 966 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:59,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1040 Valid, 1538 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 00:25:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2021-11-17 00:25:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 992. [2021-11-17 00:25:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 738 states have (on average 1.2764227642276422) internal successors, (942), 754 states have internal predecessors, (942), 185 states have call successors, (185), 69 states have call predecessors, (185), 68 states have return successors, (180), 174 states have call predecessors, (180), 180 states have call successors, (180) [2021-11-17 00:25:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1307 transitions. [2021-11-17 00:25:59,245 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1307 transitions. Word has length 34 [2021-11-17 00:25:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:59,246 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 1307 transitions. [2021-11-17 00:25:59,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:25:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1307 transitions. [2021-11-17 00:25:59,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-17 00:25:59,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:59,255 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:25:59,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 00:25:59,256 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:59,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash -406405667, now seen corresponding path program 1 times [2021-11-17 00:25:59,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:59,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739071932] [2021-11-17 00:25:59,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:59,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:59,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:25:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:59,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:25:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:59,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:25:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:25:59,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:59,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739071932] [2021-11-17 00:25:59,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739071932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:59,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:59,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 00:25:59,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545564092] [2021-11-17 00:25:59,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:59,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:25:59,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:59,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:25:59,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:25:59,380 INFO L87 Difference]: Start difference. First operand 992 states and 1307 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:00,040 INFO L93 Difference]: Finished difference Result 1106 states and 1483 transitions. [2021-11-17 00:26:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:26:00,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2021-11-17 00:26:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:00,049 INFO L225 Difference]: With dead ends: 1106 [2021-11-17 00:26:00,049 INFO L226 Difference]: Without dead ends: 1093 [2021-11-17 00:26:00,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:26:00,051 INFO L933 BasicCegarLoop]: 643 mSDtfsCounter, 799 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:00,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [852 Valid, 936 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 00:26:00,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-11-17 00:26:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 992. [2021-11-17 00:26:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 738 states have (on average 1.2750677506775068) internal successors, (941), 754 states have internal predecessors, (941), 185 states have call successors, (185), 69 states have call predecessors, (185), 68 states have return successors, (180), 174 states have call predecessors, (180), 180 states have call successors, (180) [2021-11-17 00:26:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1306 transitions. [2021-11-17 00:26:00,119 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1306 transitions. Word has length 44 [2021-11-17 00:26:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:00,120 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 1306 transitions. [2021-11-17 00:26:00,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1306 transitions. [2021-11-17 00:26:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-17 00:26:00,122 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:00,122 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:00,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 00:26:00,123 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:00,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:00,123 INFO L85 PathProgramCache]: Analyzing trace with hash -349147365, now seen corresponding path program 1 times [2021-11-17 00:26:00,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:00,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776341637] [2021-11-17 00:26:00,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:00,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:00,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:00,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:00,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:00,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:26:00,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:00,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776341637] [2021-11-17 00:26:00,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776341637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:00,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:26:00,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 00:26:00,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789498195] [2021-11-17 00:26:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:00,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:26:00,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:00,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:26:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:26:00,256 INFO L87 Difference]: Start difference. First operand 992 states and 1306 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:01,446 INFO L93 Difference]: Finished difference Result 3133 states and 4280 transitions. [2021-11-17 00:26:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:26:01,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2021-11-17 00:26:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:01,456 INFO L225 Difference]: With dead ends: 3133 [2021-11-17 00:26:01,456 INFO L226 Difference]: Without dead ends: 2150 [2021-11-17 00:26:01,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:26:01,465 INFO L933 BasicCegarLoop]: 730 mSDtfsCounter, 970 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:01,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1037 Valid, 1544 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-17 00:26:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2021-11-17 00:26:01,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2000. [2021-11-17 00:26:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1487 states have (on average 1.2703429724277069) internal successors, (1889), 1519 states have internal predecessors, (1889), 366 states have call successors, (366), 137 states have call predecessors, (366), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2021-11-17 00:26:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2670 transitions. [2021-11-17 00:26:01,555 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2670 transitions. Word has length 44 [2021-11-17 00:26:01,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:01,555 INFO L470 AbstractCegarLoop]: Abstraction has 2000 states and 2670 transitions. [2021-11-17 00:26:01,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2670 transitions. [2021-11-17 00:26:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-17 00:26:01,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:01,557 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:01,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 00:26:01,557 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:01,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:01,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2061086592, now seen corresponding path program 1 times [2021-11-17 00:26:01,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:01,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175311790] [2021-11-17 00:26:01,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:01,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:01,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:01,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:26:01,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:01,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175311790] [2021-11-17 00:26:01,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175311790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:01,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:26:01,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 00:26:01,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700107369] [2021-11-17 00:26:01,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:01,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:26:01,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:01,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:26:01,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:26:01,699 INFO L87 Difference]: Start difference. First operand 2000 states and 2670 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:02,352 INFO L93 Difference]: Finished difference Result 2142 states and 2912 transitions. [2021-11-17 00:26:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:26:02,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2021-11-17 00:26:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:02,364 INFO L225 Difference]: With dead ends: 2142 [2021-11-17 00:26:02,364 INFO L226 Difference]: Without dead ends: 2139 [2021-11-17 00:26:02,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:26:02,370 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 777 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:02,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 889 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 00:26:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2021-11-17 00:26:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1999. [2021-11-17 00:26:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1487 states have (on average 1.269670477471419) internal successors, (1888), 1518 states have internal predecessors, (1888), 365 states have call successors, (365), 137 states have call predecessors, (365), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2021-11-17 00:26:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2668 transitions. [2021-11-17 00:26:02,456 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2668 transitions. Word has length 45 [2021-11-17 00:26:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:02,456 INFO L470 AbstractCegarLoop]: Abstraction has 1999 states and 2668 transitions. [2021-11-17 00:26:02,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2668 transitions. [2021-11-17 00:26:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-17 00:26:02,458 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:02,459 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:02,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 00:26:02,459 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:02,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash -531067202, now seen corresponding path program 1 times [2021-11-17 00:26:02,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:02,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331120127] [2021-11-17 00:26:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:02,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:02,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:02,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:26:02,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:02,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331120127] [2021-11-17 00:26:02,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331120127] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:02,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:26:02,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 00:26:02,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092183042] [2021-11-17 00:26:02,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:02,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:26:02,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:02,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:26:02,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:26:02,609 INFO L87 Difference]: Start difference. First operand 1999 states and 2668 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:03,209 INFO L93 Difference]: Finished difference Result 2141 states and 2910 transitions. [2021-11-17 00:26:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:26:03,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2021-11-17 00:26:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:03,220 INFO L225 Difference]: With dead ends: 2141 [2021-11-17 00:26:03,220 INFO L226 Difference]: Without dead ends: 2138 [2021-11-17 00:26:03,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:26:03,222 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 773 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:03,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [822 Valid, 889 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 00:26:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2021-11-17 00:26:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1998. [2021-11-17 00:26:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1487 states have (on average 1.2689979825151312) internal successors, (1887), 1517 states have internal predecessors, (1887), 364 states have call successors, (364), 137 states have call predecessors, (364), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2021-11-17 00:26:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2666 transitions. [2021-11-17 00:26:03,318 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2666 transitions. Word has length 46 [2021-11-17 00:26:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:03,318 INFO L470 AbstractCegarLoop]: Abstraction has 1998 states and 2666 transitions. [2021-11-17 00:26:03,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2666 transitions. [2021-11-17 00:26:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-17 00:26:03,320 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:03,320 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:03,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 00:26:03,320 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:03,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:03,321 INFO L85 PathProgramCache]: Analyzing trace with hash 716548675, now seen corresponding path program 1 times [2021-11-17 00:26:03,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:03,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172398685] [2021-11-17 00:26:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:03,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:03,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:03,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:26:03,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:03,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172398685] [2021-11-17 00:26:03,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172398685] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:03,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:26:03,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 00:26:03,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460766470] [2021-11-17 00:26:03,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:03,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:26:03,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:03,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:26:03,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:26:03,417 INFO L87 Difference]: Start difference. First operand 1998 states and 2666 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:03,992 INFO L93 Difference]: Finished difference Result 2140 states and 2908 transitions. [2021-11-17 00:26:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:26:03,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2021-11-17 00:26:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:04,006 INFO L225 Difference]: With dead ends: 2140 [2021-11-17 00:26:04,006 INFO L226 Difference]: Without dead ends: 2137 [2021-11-17 00:26:04,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:26:04,009 INFO L933 BasicCegarLoop]: 621 mSDtfsCounter, 770 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:04,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [819 Valid, 886 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 00:26:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2021-11-17 00:26:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1997. [2021-11-17 00:26:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1487 states have (on average 1.2683254875588432) internal successors, (1886), 1516 states have internal predecessors, (1886), 363 states have call successors, (363), 137 states have call predecessors, (363), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2021-11-17 00:26:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2664 transitions. [2021-11-17 00:26:04,136 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2664 transitions. Word has length 47 [2021-11-17 00:26:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:04,137 INFO L470 AbstractCegarLoop]: Abstraction has 1997 states and 2664 transitions. [2021-11-17 00:26:04,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2664 transitions. [2021-11-17 00:26:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-17 00:26:04,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:04,139 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:04,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 00:26:04,139 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash 737940065, now seen corresponding path program 1 times [2021-11-17 00:26:04,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:04,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661560389] [2021-11-17 00:26:04,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:04,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:04,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:26:04,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:04,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661560389] [2021-11-17 00:26:04,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661560389] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:04,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:26:04,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 00:26:04,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455395392] [2021-11-17 00:26:04,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:04,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:26:04,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:04,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:26:04,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:26:04,249 INFO L87 Difference]: Start difference. First operand 1997 states and 2664 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:04,809 INFO L93 Difference]: Finished difference Result 2139 states and 2906 transitions. [2021-11-17 00:26:04,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:26:04,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2021-11-17 00:26:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:04,819 INFO L225 Difference]: With dead ends: 2139 [2021-11-17 00:26:04,820 INFO L226 Difference]: Without dead ends: 2127 [2021-11-17 00:26:04,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:26:04,821 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 767 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:04,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 885 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 00:26:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2021-11-17 00:26:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1987. [2021-11-17 00:26:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1478 states have (on average 1.2679296346414073) internal successors, (1874), 1506 states have internal predecessors, (1874), 362 states have call successors, (362), 137 states have call predecessors, (362), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2021-11-17 00:26:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2651 transitions. [2021-11-17 00:26:04,904 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2651 transitions. Word has length 48 [2021-11-17 00:26:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:04,905 INFO L470 AbstractCegarLoop]: Abstraction has 1987 states and 2651 transitions. [2021-11-17 00:26:04,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:26:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2651 transitions. [2021-11-17 00:26:04,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-17 00:26:04,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:04,915 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:04,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 00:26:04,915 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:04,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:04,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1153772682, now seen corresponding path program 1 times [2021-11-17 00:26:04,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:04,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921341158] [2021-11-17 00:26:04,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:04,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:26:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 00:26:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 00:26:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:26:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 00:26:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 00:26:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 00:26:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 00:26:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:26:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:26:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 00:26:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 00:26:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 00:26:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-17 00:26:05,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:05,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921341158] [2021-11-17 00:26:05,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921341158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:05,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:26:05,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:26:05,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040827366] [2021-11-17 00:26:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:05,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:26:05,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:05,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:26:05,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:26:05,134 INFO L87 Difference]: Start difference. First operand 1987 states and 2651 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 00:26:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:06,539 INFO L93 Difference]: Finished difference Result 5900 states and 7924 transitions. [2021-11-17 00:26:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:26:06,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 153 [2021-11-17 00:26:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:06,559 INFO L225 Difference]: With dead ends: 5900 [2021-11-17 00:26:06,559 INFO L226 Difference]: Without dead ends: 3922 [2021-11-17 00:26:06,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:26:06,566 INFO L933 BasicCegarLoop]: 699 mSDtfsCounter, 1540 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:06,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1579 Valid, 1837 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 00:26:06,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2021-11-17 00:26:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3516. [2021-11-17 00:26:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 2593 states have (on average 1.261473197069032) internal successors, (3271), 2651 states have internal predecessors, (3271), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2021-11-17 00:26:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4670 transitions. [2021-11-17 00:26:06,732 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4670 transitions. Word has length 153 [2021-11-17 00:26:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:06,733 INFO L470 AbstractCegarLoop]: Abstraction has 3516 states and 4670 transitions. [2021-11-17 00:26:06,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 00:26:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4670 transitions. [2021-11-17 00:26:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-17 00:26:06,741 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:06,741 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:06,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 00:26:06,742 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash 425318257, now seen corresponding path program 1 times [2021-11-17 00:26:06,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:06,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976839025] [2021-11-17 00:26:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:06,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:26:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 00:26:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 00:26:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 00:26:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:26:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 00:26:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 00:26:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 00:26:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:26:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:26:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 00:26:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 00:26:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-17 00:26:06,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:06,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976839025] [2021-11-17 00:26:06,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976839025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:06,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:26:06,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:26:06,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893982755] [2021-11-17 00:26:06,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:06,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:26:06,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:26:06,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:26:06,970 INFO L87 Difference]: Start difference. First operand 3516 states and 4670 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 00:26:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:07,919 INFO L93 Difference]: Finished difference Result 7416 states and 9930 transitions. [2021-11-17 00:26:07,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:26:07,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2021-11-17 00:26:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:07,942 INFO L225 Difference]: With dead ends: 7416 [2021-11-17 00:26:07,942 INFO L226 Difference]: Without dead ends: 3916 [2021-11-17 00:26:07,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:26:07,956 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 867 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:07,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [870 Valid, 1459 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-17 00:26:07,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2021-11-17 00:26:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3520. [2021-11-17 00:26:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2597 states have (on average 1.261070465922218) internal successors, (3275), 2655 states have internal predecessors, (3275), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2021-11-17 00:26:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4674 transitions. [2021-11-17 00:26:08,164 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4674 transitions. Word has length 162 [2021-11-17 00:26:08,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:08,165 INFO L470 AbstractCegarLoop]: Abstraction has 3520 states and 4674 transitions. [2021-11-17 00:26:08,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 00:26:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4674 transitions. [2021-11-17 00:26:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-17 00:26:08,173 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:08,173 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:08,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 00:26:08,174 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash -632519821, now seen corresponding path program 1 times [2021-11-17 00:26:08,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:08,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038099962] [2021-11-17 00:26:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:08,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:26:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 00:26:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 00:26:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 00:26:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:26:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 00:26:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 00:26:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 00:26:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:26:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:26:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 00:26:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 00:26:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-17 00:26:08,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:08,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038099962] [2021-11-17 00:26:08,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038099962] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:26:08,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186420938] [2021-11-17 00:26:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:08,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:26:08,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:26:08,451 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) [2021-11-17 00:26:08,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 00:26:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:08,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 1919 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 00:26:08,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:26:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-17 00:26:09,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 00:26:09,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186420938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:09,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:26:09,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-11-17 00:26:09,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327917428] [2021-11-17 00:26:09,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:09,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:26:09,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:09,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:26:09,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:26:09,327 INFO L87 Difference]: Start difference. First operand 3520 states and 4674 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 00:26:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:09,733 INFO L93 Difference]: Finished difference Result 9962 states and 13915 transitions. [2021-11-17 00:26:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:26:09,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2021-11-17 00:26:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:09,772 INFO L225 Difference]: With dead ends: 9962 [2021-11-17 00:26:09,773 INFO L226 Difference]: Without dead ends: 6458 [2021-11-17 00:26:09,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:26:09,785 INFO L933 BasicCegarLoop]: 1154 mSDtfsCounter, 852 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 3869 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:09,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [880 Valid, 3869 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:26:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2021-11-17 00:26:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 3532. [2021-11-17 00:26:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 2609 states have (on average 1.2598696818704485) internal successors, (3287), 2667 states have internal predecessors, (3287), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2021-11-17 00:26:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4686 transitions. [2021-11-17 00:26:10,004 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4686 transitions. Word has length 162 [2021-11-17 00:26:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:10,004 INFO L470 AbstractCegarLoop]: Abstraction has 3532 states and 4686 transitions. [2021-11-17 00:26:10,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 00:26:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4686 transitions. [2021-11-17 00:26:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-17 00:26:10,013 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:10,013 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:10,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-17 00:26:10,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-17 00:26:10,240 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 625799758, now seen corresponding path program 1 times [2021-11-17 00:26:10,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:10,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145366740] [2021-11-17 00:26:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:10,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:26:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 00:26:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 00:26:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 00:26:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:26:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 00:26:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 00:26:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 00:26:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 00:26:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:26:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:26:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 00:26:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-17 00:26:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-17 00:26:10,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:10,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145366740] [2021-11-17 00:26:10,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145366740] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:26:10,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694162843] [2021-11-17 00:26:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:10,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:26:10,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:26:10,519 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) [2021-11-17 00:26:10,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-17 00:26:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:10,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-17 00:26:10,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:26:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-17 00:26:11,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 00:26:11,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694162843] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:11,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:26:11,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2021-11-17 00:26:11,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200717768] [2021-11-17 00:26:11,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:11,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:26:11,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:11,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:26:11,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:26:11,277 INFO L87 Difference]: Start difference. First operand 3532 states and 4686 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 00:26:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:12,302 INFO L93 Difference]: Finished difference Result 14900 states and 20710 transitions. [2021-11-17 00:26:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-17 00:26:12,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 172 [2021-11-17 00:26:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:12,346 INFO L225 Difference]: With dead ends: 14900 [2021-11-17 00:26:12,347 INFO L226 Difference]: Without dead ends: 11384 [2021-11-17 00:26:12,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2021-11-17 00:26:12,362 INFO L933 BasicCegarLoop]: 1728 mSDtfsCounter, 1640 mSDsluCounter, 5450 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:12,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1678 Valid, 7178 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 00:26:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11384 states. [2021-11-17 00:26:12,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11384 to 7096. [2021-11-17 00:26:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7096 states, 5241 states have (on average 1.2577752337340202) internal successors, (6592), 5365 states have internal predecessors, (6592), 1261 states have call successors, (1261), 514 states have call predecessors, (1261), 593 states have return successors, (1560), 1256 states have call predecessors, (1560), 1260 states have call successors, (1560) [2021-11-17 00:26:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 9413 transitions. [2021-11-17 00:26:12,792 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 9413 transitions. Word has length 172 [2021-11-17 00:26:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:12,792 INFO L470 AbstractCegarLoop]: Abstraction has 7096 states and 9413 transitions. [2021-11-17 00:26:12,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 00:26:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 9413 transitions. [2021-11-17 00:26:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-17 00:26:12,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:12,808 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:12,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-17 00:26:13,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-17 00:26:13,023 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:13,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash -385317492, now seen corresponding path program 1 times [2021-11-17 00:26:13,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:13,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895271304] [2021-11-17 00:26:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:13,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:26:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 00:26:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 00:26:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 00:26:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:26:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 00:26:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 00:26:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 00:26:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 00:26:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:26:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:26:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 00:26:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-17 00:26:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-17 00:26:13,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:13,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895271304] [2021-11-17 00:26:13,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895271304] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:26:13,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998885738] [2021-11-17 00:26:13,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:13,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:26:13,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:26:13,331 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) [2021-11-17 00:26:13,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-17 00:26:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:13,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-17 00:26:13,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:26:14,162 INFO L354 Elim1Store]: treesize reduction 90, result has 15.9 percent of original size [2021-11-17 00:26:14,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2021-11-17 00:26:14,242 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-17 00:26:14,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-11-17 00:26:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-17 00:26:14,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 00:26:14,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998885738] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:14,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:26:14,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2021-11-17 00:26:14,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187113230] [2021-11-17 00:26:14,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:14,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 00:26:14,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 00:26:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-11-17 00:26:14,463 INFO L87 Difference]: Start difference. First operand 7096 states and 9413 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 00:26:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:17,308 INFO L93 Difference]: Finished difference Result 16712 states and 22395 transitions. [2021-11-17 00:26:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 00:26:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 172 [2021-11-17 00:26:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:17,342 INFO L225 Difference]: With dead ends: 16712 [2021-11-17 00:26:17,343 INFO L226 Difference]: Without dead ends: 9632 [2021-11-17 00:26:17,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-11-17 00:26:17,366 INFO L933 BasicCegarLoop]: 1016 mSDtfsCounter, 670 mSDsluCounter, 4690 mSDsCounter, 0 mSdLazyCounter, 2924 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 5706 SdHoareTripleChecker+Invalid, 3643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:17,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 5706 Invalid, 3643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2924 Invalid, 0 Unknown, 523 Unchecked, 2.3s Time] [2021-11-17 00:26:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2021-11-17 00:26:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 8652. [2021-11-17 00:26:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8652 states, 6423 states have (on average 1.2665421142768176) internal successors, (8135), 6573 states have internal predecessors, (8135), 1497 states have call successors, (1497), 645 states have call predecessors, (1497), 731 states have return successors, (1863), 1473 states have call predecessors, (1863), 1496 states have call successors, (1863) [2021-11-17 00:26:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8652 states to 8652 states and 11495 transitions. [2021-11-17 00:26:17,891 INFO L78 Accepts]: Start accepts. Automaton has 8652 states and 11495 transitions. Word has length 172 [2021-11-17 00:26:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:17,891 INFO L470 AbstractCegarLoop]: Abstraction has 8652 states and 11495 transitions. [2021-11-17 00:26:17,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 00:26:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8652 states and 11495 transitions. [2021-11-17 00:26:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-17 00:26:17,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:17,914 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:17,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-17 00:26:18,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:26:18,136 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1960940060, now seen corresponding path program 1 times [2021-11-17 00:26:18,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:18,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826148792] [2021-11-17 00:26:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:18,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:26:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 00:26:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 00:26:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-17 00:26:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 00:26:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-17 00:26:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 00:26:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 00:26:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 00:26:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:26:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:26:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-17 00:26:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-11-17 00:26:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-17 00:26:18,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:18,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826148792] [2021-11-17 00:26:18,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826148792] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:26:18,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309722489] [2021-11-17 00:26:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:18,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:26:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:26:18,414 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) [2021-11-17 00:26:18,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-17 00:26:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:18,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 1984 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-17 00:26:18,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:26:18,944 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-17 00:26:18,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 33 [2021-11-17 00:26:19,031 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 00:26:19,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2021-11-17 00:26:19,105 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 00:26:19,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2021-11-17 00:26:19,171 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 00:26:19,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2021-11-17 00:26:19,335 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 00:26:19,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2021-11-17 00:26:19,555 INFO L354 Elim1Store]: treesize reduction 150, result has 12.3 percent of original size [2021-11-17 00:26:19,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 44 [2021-11-17 00:26:19,607 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 00:26:19,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2021-11-17 00:26:19,737 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 00:26:19,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2021-11-17 00:26:19,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-17 00:26:19,841 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-17 00:26:19,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 19 [2021-11-17 00:26:19,925 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-17 00:26:19,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2021-11-17 00:26:19,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2021-11-17 00:26:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-17 00:26:20,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:26:23,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309722489] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:26:23,546 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:26:23,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2021-11-17 00:26:23,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517894168] [2021-11-17 00:26:23,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:26:23,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-17 00:26:23,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:23,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-17 00:26:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=623, Unknown=4, NotChecked=0, Total=702 [2021-11-17 00:26:23,548 INFO L87 Difference]: Start difference. First operand 8652 states and 11495 transitions. Second operand has 21 states, 21 states have (on average 9.238095238095237) internal successors, (194), 14 states have internal predecessors, (194), 4 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 6 states have call predecessors, (36), 4 states have call successors, (36) [2021-11-17 00:26:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:26,471 INFO L93 Difference]: Finished difference Result 18242 states and 24514 transitions. [2021-11-17 00:26:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-17 00:26:26,472 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.238095238095237) internal successors, (194), 14 states have internal predecessors, (194), 4 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 6 states have call predecessors, (36), 4 states have call successors, (36) Word has length 178 [2021-11-17 00:26:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:26,511 INFO L225 Difference]: With dead ends: 18242 [2021-11-17 00:26:26,512 INFO L226 Difference]: Without dead ends: 10290 [2021-11-17 00:26:26,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=184, Invalid=1294, Unknown=4, NotChecked=0, Total=1482 [2021-11-17 00:26:26,539 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 1255 mSDsluCounter, 5688 mSDsCounter, 0 mSdLazyCounter, 3117 mSolverCounterSat, 768 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 6377 SdHoareTripleChecker+Invalid, 4836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 768 IncrementalHoareTripleChecker+Valid, 3117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 951 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:26,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1262 Valid, 6377 Invalid, 4836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [768 Valid, 3117 Invalid, 0 Unknown, 951 Unchecked, 2.3s Time] [2021-11-17 00:26:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10290 states. [2021-11-17 00:26:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10290 to 9194. [2021-11-17 00:26:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9194 states, 6834 states have (on average 1.271436932982148) internal successors, (8689), 7008 states have internal predecessors, (8689), 1584 states have call successors, (1584), 691 states have call predecessors, (1584), 775 states have return successors, (1955), 1534 states have call predecessors, (1955), 1583 states have call successors, (1955) [2021-11-17 00:26:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9194 states to 9194 states and 12228 transitions. [2021-11-17 00:26:27,120 INFO L78 Accepts]: Start accepts. Automaton has 9194 states and 12228 transitions. Word has length 178 [2021-11-17 00:26:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:27,121 INFO L470 AbstractCegarLoop]: Abstraction has 9194 states and 12228 transitions. [2021-11-17 00:26:27,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.238095238095237) internal successors, (194), 14 states have internal predecessors, (194), 4 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 6 states have call predecessors, (36), 4 states have call successors, (36) [2021-11-17 00:26:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 9194 states and 12228 transitions. [2021-11-17 00:26:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-11-17 00:26:27,145 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:27,146 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:27,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-17 00:26:27,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:26:27,372 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:27,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1411015937, now seen corresponding path program 1 times [2021-11-17 00:26:27,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:27,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257389910] [2021-11-17 00:26:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:27,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:26:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 00:26:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 00:26:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 00:26:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 00:26:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 00:26:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 00:26:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-17 00:26:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 00:26:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:26:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:26:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 00:26:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 00:26:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-17 00:26:27,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:27,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257389910] [2021-11-17 00:26:27,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257389910] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:26:27,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688963340] [2021-11-17 00:26:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:27,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:26:27,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:26:27,702 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) [2021-11-17 00:26:27,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-17 00:26:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:28,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 1992 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-17 00:26:28,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:26:28,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 00:26:28,402 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-17 00:26:28,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2021-11-17 00:26:28,470 INFO L354 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2021-11-17 00:26:28,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2021-11-17 00:26:28,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-17 00:26:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-17 00:26:28,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:26:29,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_8| Int)) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| |ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset|) |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_8|)) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2021-11-17 00:26:31,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13| Int)) (or (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| Int) (|ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_8| Int) (v_DerPreprocessor_5 Int)) (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13|) (+ 420 |ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_DerPreprocessor_5) (+ 930 |ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_8|)) 26) 1))) (< |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.base| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13|))) is different from false [2021-11-17 00:26:33,358 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| Int) (|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13| Int) (|ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_8| Int) (v_DerPreprocessor_5 Int)) (or (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13|) (+ 420 |ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_DerPreprocessor_5) (+ 930 |ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_8|)) 26) 1)) (< |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.base| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13|))) is different from false [2021-11-17 00:26:34,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| Int) (|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13| Int) (|ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_8| Int) (v_DerPreprocessor_5 Int)) (or (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13|) (+ 420 |ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_DerPreprocessor_5) (+ 930 |ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) 1250) |ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_8|)) 26) 1)) (< 0 |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_13|))) is different from false [2021-11-17 00:26:34,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688963340] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:26:34,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:26:34,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2021-11-17 00:26:34,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060157352] [2021-11-17 00:26:34,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:26:34,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-17 00:26:34,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:34,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-17 00:26:34,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=536, Unknown=5, NotChecked=196, Total=812 [2021-11-17 00:26:34,008 INFO L87 Difference]: Start difference. First operand 9194 states and 12228 transitions. Second operand has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) [2021-11-17 00:26:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:37,985 INFO L93 Difference]: Finished difference Result 18760 states and 25543 transitions. [2021-11-17 00:26:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-17 00:26:37,986 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) Word has length 180 [2021-11-17 00:26:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:38,036 INFO L225 Difference]: With dead ends: 18760 [2021-11-17 00:26:38,036 INFO L226 Difference]: Without dead ends: 11636 [2021-11-17 00:26:38,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=167, Invalid=1104, Unknown=5, NotChecked=284, Total=1560 [2021-11-17 00:26:38,062 INFO L933 BasicCegarLoop]: 789 mSDtfsCounter, 1896 mSDsluCounter, 8896 mSDsCounter, 0 mSdLazyCounter, 5176 mSolverCounterSat, 819 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 9685 SdHoareTripleChecker+Invalid, 6457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 819 IncrementalHoareTripleChecker+Valid, 5176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:38,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1918 Valid, 9685 Invalid, 6457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [819 Valid, 5176 Invalid, 0 Unknown, 462 Unchecked, 3.3s Time] [2021-11-17 00:26:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11636 states. [2021-11-17 00:26:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11636 to 9228. [2021-11-17 00:26:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9228 states, 6856 states have (on average 1.270565927654609) internal successors, (8711), 7028 states have internal predecessors, (8711), 1592 states have call successors, (1592), 695 states have call predecessors, (1592), 779 states have return successors, (1963), 1544 states have call predecessors, (1963), 1591 states have call successors, (1963) [2021-11-17 00:26:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9228 states to 9228 states and 12266 transitions. [2021-11-17 00:26:38,645 INFO L78 Accepts]: Start accepts. Automaton has 9228 states and 12266 transitions. Word has length 180 [2021-11-17 00:26:38,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:38,646 INFO L470 AbstractCegarLoop]: Abstraction has 9228 states and 12266 transitions. [2021-11-17 00:26:38,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) [2021-11-17 00:26:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 9228 states and 12266 transitions. [2021-11-17 00:26:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-17 00:26:38,669 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:38,669 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:38,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-17 00:26:38,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-17 00:26:38,895 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:38,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:38,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1313487356, now seen corresponding path program 2 times [2021-11-17 00:26:38,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:38,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527509836] [2021-11-17 00:26:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:38,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:26:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:26:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 00:26:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 00:26:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:26:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 00:26:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 00:26:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 00:26:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 00:26:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 00:26:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:26:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:26:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-11-17 00:26:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-11-17 00:26:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-17 00:26:39,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:39,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527509836] [2021-11-17 00:26:39,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527509836] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:26:39,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037966773] [2021-11-17 00:26:39,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:26:39,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:26:39,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:26:39,183 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) [2021-11-17 00:26:39,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-17 00:26:39,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 00:26:39,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:26:39,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 2006 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-17 00:26:39,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:26:39,912 INFO L354 Elim1Store]: treesize reduction 90, result has 15.9 percent of original size [2021-11-17 00:26:39,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2021-11-17 00:26:39,962 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-17 00:26:39,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-11-17 00:26:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-17 00:26:40,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 00:26:40,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037966773] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:26:40,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:26:40,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 20 [2021-11-17 00:26:40,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572843965] [2021-11-17 00:26:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:26:40,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 00:26:40,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:26:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 00:26:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-11-17 00:26:40,115 INFO L87 Difference]: Start difference. First operand 9228 states and 12266 transitions. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 9 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-17 00:26:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:26:42,003 INFO L93 Difference]: Finished difference Result 16904 states and 22591 transitions. [2021-11-17 00:26:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 00:26:42,004 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 9 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 184 [2021-11-17 00:26:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:26:42,042 INFO L225 Difference]: With dead ends: 16904 [2021-11-17 00:26:42,042 INFO L226 Difference]: Without dead ends: 9776 [2021-11-17 00:26:42,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-11-17 00:26:42,063 INFO L933 BasicCegarLoop]: 757 mSDtfsCounter, 746 mSDsluCounter, 3665 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 4422 SdHoareTripleChecker+Invalid, 3153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 505 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:26:42,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 4422 Invalid, 3153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2415 Invalid, 0 Unknown, 505 Unchecked, 1.5s Time] [2021-11-17 00:26:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9776 states. [2021-11-17 00:26:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9776 to 9236. [2021-11-17 00:26:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9236 states, 6864 states have (on average 1.2702505827505828) internal successors, (8719), 7036 states have internal predecessors, (8719), 1592 states have call successors, (1592), 695 states have call predecessors, (1592), 779 states have return successors, (1963), 1544 states have call predecessors, (1963), 1591 states have call successors, (1963) [2021-11-17 00:26:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9236 states to 9236 states and 12274 transitions. [2021-11-17 00:26:42,607 INFO L78 Accepts]: Start accepts. Automaton has 9236 states and 12274 transitions. Word has length 184 [2021-11-17 00:26:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:26:42,608 INFO L470 AbstractCegarLoop]: Abstraction has 9236 states and 12274 transitions. [2021-11-17 00:26:42,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 9 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-17 00:26:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 9236 states and 12274 transitions. [2021-11-17 00:26:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-11-17 00:26:42,628 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:26:42,628 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:26:42,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-17 00:26:42,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-17 00:26:42,843 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:26:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:26:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash -435609644, now seen corresponding path program 1 times [2021-11-17 00:26:42,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:26:42,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936119618] [2021-11-17 00:26:42,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:42,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:26:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:42,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:42,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:26:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:42,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:26:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:26:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 00:26:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:26:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 00:26:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:26:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 00:26:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 00:26:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:26:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 00:26:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 00:26:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 00:26:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 00:26:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:26:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:26:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 00:26:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 00:26:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-17 00:26:43,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:26:43,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936119618] [2021-11-17 00:26:43,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936119618] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:26:43,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075663593] [2021-11-17 00:26:43,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:26:43,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:26:43,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:26:43,125 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) [2021-11-17 00:26:43,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-17 00:26:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:26:43,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 2043 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-17 00:26:43,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:26:43,590 INFO L354 Elim1Store]: treesize reduction 97, result has 17.1 percent of original size [2021-11-17 00:26:43,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 37 [2021-11-17 00:26:43,663 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-17 00:26:43,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 17 [2021-11-17 00:26:43,749 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-17 00:26:43,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 17 [2021-11-17 00:26:43,809 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-17 00:26:43,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 17 [2021-11-17 00:26:43,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2021-11-17 00:26:43,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2021-11-17 00:26:51,983 INFO L354 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2021-11-17 00:26:51,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2021-11-17 00:26:51,992 INFO L354 Elim1Store]: treesize reduction 45, result has 8.2 percent of original size [2021-11-17 00:26:51,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 39 [2021-11-17 00:27:20,490 INFO L354 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2021-11-17 00:27:20,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 62 [2021-11-17 00:27:20,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 00:27:20,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2021-11-17 00:27:20,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 00:27:20,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 00:27:20,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 00:27:20,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2021-11-17 00:27:27,266 INFO L354 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2021-11-17 00:27:27,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 74 [2021-11-17 00:27:27,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-17 00:27:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 35 proven. 16 refuted. 8 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-17 00:27:27,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:27:30,561 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_DerPreprocessor_8 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_DerPreprocessor_8) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) 1250)) 26) 0))) is different from false [2021-11-17 00:27:31,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| Int)) (or (< |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset|) (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_DerPreprocessor_8 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| 420) v_DerPreprocessor_8) (+ |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| 930) 1250)) 26) 0))))) is different from false [2021-11-17 00:27:32,744 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| Int) (v_DerPreprocessor_8 Int)) (or (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| 420) v_DerPreprocessor_8) (+ |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| 930) 1250)) 26) 0)) (< |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset|))) is different from false [2021-11-17 00:27:33,548 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| Int) (v_DerPreprocessor_8 Int)) (or (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| 420) v_DerPreprocessor_8) (+ |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| 930) 1250)) 26) 0)) (< |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset_13| 0))) is different from false [2021-11-17 00:27:33,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075663593] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:27:33,550 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:27:33,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2021-11-17 00:27:33,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026339129] [2021-11-17 00:27:33,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:27:33,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-17 00:27:33,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:27:33,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-17 00:27:33,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=572, Unknown=19, NotChecked=204, Total=870 [2021-11-17 00:27:33,552 INFO L87 Difference]: Start difference. First operand 9236 states and 12274 transitions. Second operand has 24 states, 24 states have (on average 8.875) internal successors, (213), 17 states have internal predecessors, (213), 6 states have call successors, (40), 11 states have call predecessors, (40), 9 states have return successors, (39), 8 states have call predecessors, (39), 6 states have call successors, (39) [2021-11-17 00:28:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:28:03,752 INFO L93 Difference]: Finished difference Result 20063 states and 27649 transitions. [2021-11-17 00:28:03,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-17 00:28:03,752 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.875) internal successors, (213), 17 states have internal predecessors, (213), 6 states have call successors, (40), 11 states have call predecessors, (40), 9 states have return successors, (39), 8 states have call predecessors, (39), 6 states have call successors, (39) Word has length 191 [2021-11-17 00:28:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:28:03,862 INFO L225 Difference]: With dead ends: 20063 [2021-11-17 00:28:03,862 INFO L226 Difference]: Without dead ends: 12935 [2021-11-17 00:28:03,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 76.4s TimeCoverageRelationStatistics Valid=153, Invalid=1023, Unknown=30, NotChecked=276, Total=1482 [2021-11-17 00:28:03,876 INFO L933 BasicCegarLoop]: 1057 mSDtfsCounter, 1327 mSDsluCounter, 11856 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 12913 SdHoareTripleChecker+Invalid, 5671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3460 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:28:03,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1368 Valid, 12913 Invalid, 5671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1666 Invalid, 0 Unknown, 3460 Unchecked, 1.5s Time] [2021-11-17 00:28:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12935 states. [2021-11-17 00:28:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12935 to 9742. [2021-11-17 00:28:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9742 states, 7339 states have (on average 1.2851887178089658) internal successors, (9432), 7502 states have internal predecessors, (9432), 1606 states have call successors, (1606), 712 states have call predecessors, (1606), 796 states have return successors, (1983), 1567 states have call predecessors, (1983), 1605 states have call successors, (1983) [2021-11-17 00:28:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9742 states to 9742 states and 13021 transitions. [2021-11-17 00:28:04,385 INFO L78 Accepts]: Start accepts. Automaton has 9742 states and 13021 transitions. Word has length 191 [2021-11-17 00:28:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:28:04,385 INFO L470 AbstractCegarLoop]: Abstraction has 9742 states and 13021 transitions. [2021-11-17 00:28:04,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.875) internal successors, (213), 17 states have internal predecessors, (213), 6 states have call successors, (40), 11 states have call predecessors, (40), 9 states have return successors, (39), 8 states have call predecessors, (39), 6 states have call successors, (39) [2021-11-17 00:28:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 9742 states and 13021 transitions. [2021-11-17 00:28:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-11-17 00:28:04,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:28:04,402 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:28:04,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-17 00:28:04,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:28:04,628 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:28:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:28:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2006251570, now seen corresponding path program 2 times [2021-11-17 00:28:04,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:28:04,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367731851] [2021-11-17 00:28:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:28:04,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:28:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:28:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:28:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:28:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 00:28:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:28:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 00:28:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 00:28:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 00:28:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 00:28:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 00:28:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 00:28:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-11-17 00:28:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 00:28:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:28:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:28:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 00:28:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 00:28:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-11-17 00:28:04,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:28:04,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367731851] [2021-11-17 00:28:04,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367731851] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:28:04,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:28:04,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 00:28:04,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361610819] [2021-11-17 00:28:04,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:28:04,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 00:28:04,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:28:04,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 00:28:04,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:28:04,840 INFO L87 Difference]: Start difference. First operand 9742 states and 13021 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 00:28:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:28:06,633 INFO L93 Difference]: Finished difference Result 20232 states and 27756 transitions. [2021-11-17 00:28:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:28:06,634 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 197 [2021-11-17 00:28:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:28:06,683 INFO L225 Difference]: With dead ends: 20232 [2021-11-17 00:28:06,684 INFO L226 Difference]: Without dead ends: 13048 [2021-11-17 00:28:06,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:28:06,707 INFO L933 BasicCegarLoop]: 851 mSDtfsCounter, 1112 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:28:06,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1179 Valid, 2741 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 00:28:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13048 states. [2021-11-17 00:28:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13048 to 9726. [2021-11-17 00:28:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9726 states, 7331 states have (on average 1.2844086754876551) internal successors, (9416), 7494 states have internal predecessors, (9416), 1598 states have call successors, (1598), 712 states have call predecessors, (1598), 796 states have return successors, (1971), 1559 states have call predecessors, (1971), 1597 states have call successors, (1971) [2021-11-17 00:28:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9726 states to 9726 states and 12985 transitions. [2021-11-17 00:28:07,361 INFO L78 Accepts]: Start accepts. Automaton has 9726 states and 12985 transitions. Word has length 197 [2021-11-17 00:28:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:28:07,361 INFO L470 AbstractCegarLoop]: Abstraction has 9726 states and 12985 transitions. [2021-11-17 00:28:07,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 00:28:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 9726 states and 12985 transitions. [2021-11-17 00:28:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-11-17 00:28:07,378 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:28:07,378 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:28:07,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 00:28:07,379 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:28:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:28:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1289534862, now seen corresponding path program 1 times [2021-11-17 00:28:07,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:28:07,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095816363] [2021-11-17 00:28:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:28:07,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:28:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:28:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:28:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:28:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 00:28:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:28:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 00:28:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 00:28:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 00:28:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 00:28:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 00:28:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 00:28:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-11-17 00:28:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 00:28:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:28:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:28:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 00:28:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 00:28:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-11-17 00:28:07,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:28:07,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095816363] [2021-11-17 00:28:07,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095816363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:28:07,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:28:07,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 00:28:07,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931916989] [2021-11-17 00:28:07,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:28:07,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 00:28:07,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:28:07,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 00:28:07,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:28:07,693 INFO L87 Difference]: Start difference. First operand 9726 states and 12985 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 4 states have internal predecessors, (125), 3 states have call successors, (20), 7 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-17 00:28:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:28:09,409 INFO L93 Difference]: Finished difference Result 17914 states and 24100 transitions. [2021-11-17 00:28:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:28:09,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 4 states have internal predecessors, (125), 3 states have call successors, (20), 7 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 197 [2021-11-17 00:28:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:28:09,503 INFO L225 Difference]: With dead ends: 17914 [2021-11-17 00:28:09,504 INFO L226 Difference]: Without dead ends: 10746 [2021-11-17 00:28:09,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-11-17 00:28:09,516 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 640 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:28:09,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 3195 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-17 00:28:09,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10746 states. [2021-11-17 00:28:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10746 to 9746. [2021-11-17 00:28:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9746 states, 7347 states have (on average 1.2837893017558186) internal successors, (9432), 7506 states have internal predecessors, (9432), 1602 states have call successors, (1602), 712 states have call predecessors, (1602), 796 states have return successors, (1975), 1567 states have call predecessors, (1975), 1601 states have call successors, (1975) [2021-11-17 00:28:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 13009 transitions. [2021-11-17 00:28:10,027 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 13009 transitions. Word has length 197 [2021-11-17 00:28:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:28:10,028 INFO L470 AbstractCegarLoop]: Abstraction has 9746 states and 13009 transitions. [2021-11-17 00:28:10,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 4 states have internal predecessors, (125), 3 states have call successors, (20), 7 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-17 00:28:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 13009 transitions. [2021-11-17 00:28:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-11-17 00:28:10,043 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:28:10,043 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:28:10,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 00:28:10,044 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:28:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:28:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash -418496998, now seen corresponding path program 2 times [2021-11-17 00:28:10,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:28:10,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583054416] [2021-11-17 00:28:10,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:28:10,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:28:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:28:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:28:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:28:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 00:28:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:28:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 00:28:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 00:28:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 00:28:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 00:28:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 00:28:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 00:28:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-11-17 00:28:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 00:28:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:28:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:28:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 00:28:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 00:28:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 00:28:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:28:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-11-17 00:28:10,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:28:10,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583054416] [2021-11-17 00:28:10,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583054416] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:28:10,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12497246] [2021-11-17 00:28:10,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:28:10,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:28:10,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:28:10,340 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 00:28:10,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-17 00:28:10,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 00:28:10,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:28:10,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 2087 conjuncts, 148 conjunts are in the unsatisfiable core [2021-11-17 00:28:10,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:28:13,655 INFO L354 Elim1Store]: treesize reduction 2047, result has 18.5 percent of original size [2021-11-17 00:28:13,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 37 select indices, 37 select index equivalence classes, 595 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 110 case distinctions, treesize of input 208 treesize of output 592 [2021-11-17 00:28:16,464 INFO L354 Elim1Store]: treesize reduction 568, result has 0.2 percent of original size [2021-11-17 00:28:16,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 37 select indices, 37 select index equivalence classes, 595 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 71 case distinctions, treesize of input 473 treesize of output 399 [2021-11-17 00:28:18,688 INFO L354 Elim1Store]: treesize reduction 568, result has 0.2 percent of original size [2021-11-17 00:28:18,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 37 select indices, 37 select index equivalence classes, 595 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 71 case distinctions, treesize of input 473 treesize of output 399 [2021-11-17 00:28:18,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2021-11-17 00:28:18,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2021-11-17 00:28:19,239 INFO L354 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2021-11-17 00:28:19,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 501 treesize of output 503 [2021-11-17 00:28:20,662 INFO L354 Elim1Store]: treesize reduction 1242, result has 20.8 percent of original size [2021-11-17 00:28:20,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 595 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 145 case distinctions, treesize of input 500 treesize of output 748 [2021-11-17 00:28:24,651 INFO L354 Elim1Store]: treesize reduction 864, result has 0.1 percent of original size [2021-11-17 00:28:24,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 38 select indices, 38 select index equivalence classes, 595 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 108 case distinctions, treesize of input 634 treesize of output 558 [2021-11-17 00:28:24,701 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-17 00:28:24,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 153 [2021-11-17 00:28:54,930 INFO L354 Elim1Store]: treesize reduction 864, result has 0.1 percent of original size [2021-11-17 00:28:54,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 38 select indices, 38 select index equivalence classes, 595 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 108 case distinctions, treesize of input 634 treesize of output 558 [2021-11-17 00:28:55,003 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-17 00:28:55,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 153 [2021-11-17 00:29:31,051 INFO L354 Elim1Store]: treesize reduction 2770, result has 6.8 percent of original size [2021-11-17 00:29:31,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 595 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 148 case distinctions, treesize of input 648 treesize of output 765 [2021-11-17 00:29:33,080 INFO L354 Elim1Store]: treesize reduction 864, result has 0.1 percent of original size [2021-11-17 00:29:33,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 38 select indices, 38 select index equivalence classes, 595 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 108 case distinctions, treesize of input 627 treesize of output 551 [2021-11-17 00:29:37,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-17 00:29:44,977 INFO L354 Elim1Store]: treesize reduction 1548, result has 18.1 percent of original size [2021-11-17 00:29:44,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 39 select indices, 39 select index equivalence classes, 595 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 184 case distinctions, treesize of input 638 treesize of output 901 [2021-11-17 00:30:15,177 INFO L354 Elim1Store]: treesize reduction 1168, result has 0.1 percent of original size [2021-11-17 00:30:15,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 39 select indices, 39 select index equivalence classes, 595 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 146 case distinctions, treesize of input 784 treesize of output 706 [2021-11-17 00:30:17,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-17 00:30:26,654 INFO L354 Elim1Store]: treesize reduction 1328, result has 10.3 percent of original size [2021-11-17 00:30:26,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 40 select indices, 40 select index equivalence classes, 595 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 185 case distinctions, treesize of input 943 treesize of output 1015 [2021-11-17 00:30:36,261 INFO L354 Elim1Store]: treesize reduction 64, result has 14.7 percent of original size [2021-11-17 00:30:36,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 308 treesize of output 311 [2021-11-17 00:30:36,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 308 [2021-11-17 00:30:38,961 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-17 00:30:38,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 304 treesize of output 304 [2021-11-17 00:30:38,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-17 00:30:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 63 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-17 00:30:39,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:30:39,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12497246] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:30:39,739 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:30:39,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 29 [2021-11-17 00:30:39,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018263738] [2021-11-17 00:30:39,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:30:39,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-17 00:30:39,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:30:39,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-17 00:30:39,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1080, Unknown=2, NotChecked=0, Total=1190 [2021-11-17 00:30:39,741 INFO L87 Difference]: Start difference. First operand 9746 states and 13009 transitions. Second operand has 29 states, 29 states have (on average 7.758620689655173) internal successors, (225), 22 states have internal predecessors, (225), 8 states have call successors, (41), 12 states have call predecessors, (41), 10 states have return successors, (40), 10 states have call predecessors, (40), 8 states have call successors, (40) [2021-11-17 00:31:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:00,111 INFO L93 Difference]: Finished difference Result 19599 states and 26723 transitions. [2021-11-17 00:31:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-17 00:31:00,115 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.758620689655173) internal successors, (225), 22 states have internal predecessors, (225), 8 states have call successors, (41), 12 states have call predecessors, (41), 10 states have return successors, (40), 10 states have call predecessors, (40), 8 states have call successors, (40) Word has length 203 [2021-11-17 00:31:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:00,151 INFO L225 Difference]: With dead ends: 19599 [2021-11-17 00:31:00,152 INFO L226 Difference]: Without dead ends: 12411 [2021-11-17 00:31:00,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 350 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 50.1s TimeCoverageRelationStatistics Valid=239, Invalid=2111, Unknown=2, NotChecked=0, Total=2352 [2021-11-17 00:31:00,169 INFO L933 BasicCegarLoop]: 1057 mSDtfsCounter, 1828 mSDsluCounter, 14976 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1834 SdHoareTripleChecker+Valid, 16033 SdHoareTripleChecker+Invalid, 7538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4889 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:00,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1834 Valid, 16033 Invalid, 7538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 1940 Invalid, 0 Unknown, 4889 Unchecked, 1.5s Time] [2021-11-17 00:31:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12411 states. [2021-11-17 00:31:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12411 to 10032. [2021-11-17 00:31:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10032 states, 7611 states have (on average 1.289843647352516) internal successors, (9817), 7765 states have internal predecessors, (9817), 1612 states have call successors, (1612), 720 states have call predecessors, (1612), 808 states have return successors, (1989), 1586 states have call predecessors, (1989), 1611 states have call successors, (1989) [2021-11-17 00:31:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10032 states to 10032 states and 13418 transitions. [2021-11-17 00:31:00,737 INFO L78 Accepts]: Start accepts. Automaton has 10032 states and 13418 transitions. Word has length 203 [2021-11-17 00:31:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:00,738 INFO L470 AbstractCegarLoop]: Abstraction has 10032 states and 13418 transitions. [2021-11-17 00:31:00,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.758620689655173) internal successors, (225), 22 states have internal predecessors, (225), 8 states have call successors, (41), 12 states have call predecessors, (41), 10 states have return successors, (40), 10 states have call predecessors, (40), 8 states have call successors, (40) [2021-11-17 00:31:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 10032 states and 13418 transitions. [2021-11-17 00:31:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-11-17 00:31:00,753 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:00,754 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:00,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:00,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:31:00,958 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1381108817, now seen corresponding path program 1 times [2021-11-17 00:31:00,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:31:00,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896729453] [2021-11-17 00:31:00,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:00,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:31:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:31:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:31:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:31:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:31:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 00:31:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-17 00:31:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 00:31:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 00:31:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 00:31:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 00:31:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 00:31:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 00:31:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:31:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 00:31:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-11-17 00:31:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 00:31:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-11-17 00:31:01,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:31:01,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896729453] [2021-11-17 00:31:01,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896729453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:31:01,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:31:01,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 00:31:01,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846674486] [2021-11-17 00:31:01,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:01,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 00:31:01,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:31:01,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 00:31:01,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:31:01,250 INFO L87 Difference]: Start difference. First operand 10032 states and 13418 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 00:31:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:03,083 INFO L93 Difference]: Finished difference Result 20622 states and 28305 transitions. [2021-11-17 00:31:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 00:31:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 204 [2021-11-17 00:31:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:03,125 INFO L225 Difference]: With dead ends: 20622 [2021-11-17 00:31:03,125 INFO L226 Difference]: Without dead ends: 13402 [2021-11-17 00:31:03,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-11-17 00:31:03,146 INFO L933 BasicCegarLoop]: 848 mSDtfsCounter, 894 mSDsluCounter, 3388 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 4236 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:03,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [959 Valid, 4236 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 00:31:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13402 states. [2021-11-17 00:31:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13402 to 10060. [2021-11-17 00:31:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10060 states, 7631 states have (on average 1.2906565325645394) internal successors, (9849), 7793 states have internal predecessors, (9849), 1612 states have call successors, (1612), 720 states have call predecessors, (1612), 816 states have return successors, (2009), 1586 states have call predecessors, (2009), 1611 states have call successors, (2009) [2021-11-17 00:31:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10060 states to 10060 states and 13470 transitions. [2021-11-17 00:31:03,760 INFO L78 Accepts]: Start accepts. Automaton has 10060 states and 13470 transitions. Word has length 204 [2021-11-17 00:31:03,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:03,761 INFO L470 AbstractCegarLoop]: Abstraction has 10060 states and 13470 transitions. [2021-11-17 00:31:03,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 00:31:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 10060 states and 13470 transitions. [2021-11-17 00:31:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-11-17 00:31:03,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:03,776 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:03,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-17 00:31:03,776 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash 983589417, now seen corresponding path program 1 times [2021-11-17 00:31:03,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:31:03,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909183290] [2021-11-17 00:31:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:03,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:31:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:31:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:31:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:31:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:31:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 00:31:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-17 00:31:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 00:31:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 00:31:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 00:31:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:03,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 00:31:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 00:31:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 00:31:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:31:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 00:31:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:04,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-11-17 00:31:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-11-17 00:31:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-11-17 00:31:04,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:31:04,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909183290] [2021-11-17 00:31:04,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909183290] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:31:04,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490384897] [2021-11-17 00:31:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:04,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:31:04,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:31:04,113 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 00:31:04,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-17 00:31:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:04,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-17 00:31:04,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-11-17 00:31:04,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-11-17 00:31:05,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490384897] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 00:31:05,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:31:05,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 5] total 12 [2021-11-17 00:31:05,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719188832] [2021-11-17 00:31:05,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:05,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:31:05,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:31:05,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:31:05,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:31:05,356 INFO L87 Difference]: Start difference. First operand 10060 states and 13470 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 00:31:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:06,099 INFO L93 Difference]: Finished difference Result 17372 states and 23537 transitions. [2021-11-17 00:31:06,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:31:06,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 205 [2021-11-17 00:31:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:06,124 INFO L225 Difference]: With dead ends: 17372 [2021-11-17 00:31:06,124 INFO L226 Difference]: Without dead ends: 10104 [2021-11-17 00:31:06,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 445 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:31:06,144 INFO L933 BasicCegarLoop]: 659 mSDtfsCounter, 3 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:06,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1311 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:31:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10104 states. [2021-11-17 00:31:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10104 to 10080. [2021-11-17 00:31:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10080 states, 7651 states have (on average 1.2904195529996079) internal successors, (9873), 7813 states have internal predecessors, (9873), 1612 states have call successors, (1612), 720 states have call predecessors, (1612), 816 states have return successors, (2009), 1586 states have call predecessors, (2009), 1611 states have call successors, (2009) [2021-11-17 00:31:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10080 states to 10080 states and 13494 transitions. [2021-11-17 00:31:06,599 INFO L78 Accepts]: Start accepts. Automaton has 10080 states and 13494 transitions. Word has length 205 [2021-11-17 00:31:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:06,600 INFO L470 AbstractCegarLoop]: Abstraction has 10080 states and 13494 transitions. [2021-11-17 00:31:06,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 00:31:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 10080 states and 13494 transitions. [2021-11-17 00:31:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-17 00:31:06,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:06,615 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:06,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:06,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:31:06,830 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:06,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash -583009871, now seen corresponding path program 1 times [2021-11-17 00:31:06,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:31:06,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235908853] [2021-11-17 00:31:06,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:06,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:31:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:06,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:31:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:06,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:31:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:06,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:31:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:06,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:31:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 00:31:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:06,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-17 00:31:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:06,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 00:31:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 00:31:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 00:31:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 00:31:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 00:31:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 00:31:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:31:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 00:31:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-11-17 00:31:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-17 00:31:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2021-11-17 00:31:07,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:31:07,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235908853] [2021-11-17 00:31:07,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235908853] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:31:07,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866608617] [2021-11-17 00:31:07,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:07,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:31:07,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:31:07,144 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 00:31:07,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-17 00:31:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:07,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 2130 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-17 00:31:07,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:07,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-11-17 00:31:07,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-17 00:31:08,008 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-17 00:31:08,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-11-17 00:31:08,098 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-17 00:31:08,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-11-17 00:31:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-11-17 00:31:08,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:09,549 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_DerPreprocessor_11 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_15| Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_DerPreprocessor_11) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) 1250) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_15|)) 26) 1))) is different from false [2021-11-17 00:31:10,467 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_DerPreprocessor_11 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_15| Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_DerPreprocessor_11) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) 1250) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_15|)) 26) 1))) is different from false [2021-11-17 00:31:11,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_DerPreprocessor_11 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_15| Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset|) v_DerPreprocessor_11) (+ 930 |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset|) 1250) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_15|)) 26) 1))) is different from false [2021-11-17 00:31:12,003 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_DerPreprocessor_11 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_15| Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_DerPreprocessor_11) 930 1250) 0 |v_ULTIMATE.start_#Ultimate.C_strcpy_#t~mem384#1_15|)) 26) 1))) is different from false [2021-11-17 00:31:12,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866608617] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:31:12,005 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:31:12,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2021-11-17 00:31:12,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266607944] [2021-11-17 00:31:12,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:31:12,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-17 00:31:12,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:31:12,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-17 00:31:12,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=632, Unknown=4, NotChecked=212, Total=930 [2021-11-17 00:31:12,006 INFO L87 Difference]: Start difference. First operand 10080 states and 13494 transitions. Second operand has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 17 states have internal predecessors, (222), 5 states have call successors, (39), 9 states have call predecessors, (39), 6 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2021-11-17 00:31:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:16,808 INFO L93 Difference]: Finished difference Result 20850 states and 28649 transitions. [2021-11-17 00:31:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-17 00:31:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 17 states have internal predecessors, (222), 5 states have call successors, (39), 9 states have call predecessors, (39), 6 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) Word has length 206 [2021-11-17 00:31:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:16,849 INFO L225 Difference]: With dead ends: 20850 [2021-11-17 00:31:16,850 INFO L226 Difference]: Without dead ends: 13582 [2021-11-17 00:31:16,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=249, Invalid=1833, Unknown=4, NotChecked=364, Total=2450 [2021-11-17 00:31:16,868 INFO L933 BasicCegarLoop]: 995 mSDtfsCounter, 1662 mSDsluCounter, 10823 mSDsCounter, 0 mSdLazyCounter, 5756 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 11818 SdHoareTripleChecker+Invalid, 7005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 5756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:16,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1746 Valid, 11818 Invalid, 7005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 5756 Invalid, 0 Unknown, 485 Unchecked, 3.7s Time] [2021-11-17 00:31:16,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13582 states. [2021-11-17 00:31:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13582 to 10104. [2021-11-17 00:31:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10104 states, 7675 states have (on average 1.2905537459283387) internal successors, (9905), 7837 states have internal predecessors, (9905), 1612 states have call successors, (1612), 720 states have call predecessors, (1612), 816 states have return successors, (2009), 1586 states have call predecessors, (2009), 1611 states have call successors, (2009) [2021-11-17 00:31:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10104 states to 10104 states and 13526 transitions. [2021-11-17 00:31:17,514 INFO L78 Accepts]: Start accepts. Automaton has 10104 states and 13526 transitions. Word has length 206 [2021-11-17 00:31:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:17,514 INFO L470 AbstractCegarLoop]: Abstraction has 10104 states and 13526 transitions. [2021-11-17 00:31:17,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 17 states have internal predecessors, (222), 5 states have call successors, (39), 9 states have call predecessors, (39), 6 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2021-11-17 00:31:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 10104 states and 13526 transitions. [2021-11-17 00:31:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-11-17 00:31:17,526 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:17,526 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:17,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:17,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-17 00:31:17,727 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:17,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:17,728 INFO L85 PathProgramCache]: Analyzing trace with hash -158585203, now seen corresponding path program 1 times [2021-11-17 00:31:17,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:31:17,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950311225] [2021-11-17 00:31:17,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:17,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:31:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:31:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:31:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:31:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 00:31:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:31:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 00:31:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 00:31:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 00:31:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 00:31:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 00:31:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-11-17 00:31:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:17,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 00:31:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 00:31:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:18,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:31:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:31:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:18,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 00:31:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 00:31:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:18,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-11-17 00:31:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2021-11-17 00:31:18,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:31:18,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950311225] [2021-11-17 00:31:18,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950311225] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:31:18,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204340275] [2021-11-17 00:31:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:18,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:31:18,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:31:18,162 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 00:31:18,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-17 00:31:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:18,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 2207 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-17 00:31:18,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:18,678 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-17 00:31:18,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 33 [2021-11-17 00:31:18,745 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 00:31:18,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2021-11-17 00:31:18,811 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 00:31:18,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2021-11-17 00:31:19,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-11-17 00:31:19,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-17 00:31:21,561 INFO L354 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2021-11-17 00:31:21,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2021-11-17 00:31:21,607 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-17 00:31:21,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 36 [2021-11-17 00:31:21,710 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-17 00:31:21,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 21 [2021-11-17 00:31:22,164 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-17 00:31:22,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 21 [2021-11-17 00:31:22,681 INFO L354 Elim1Store]: treesize reduction 215, result has 10.8 percent of original size [2021-11-17 00:31:22,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 60 [2021-11-17 00:31:22,755 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-17 00:31:22,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 21 [2021-11-17 00:31:23,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-17 00:31:26,273 INFO L354 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2021-11-17 00:31:26,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 56 [2021-11-17 00:31:26,634 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-11-17 00:31:26,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 36 [2021-11-17 00:31:26,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-17 00:31:28,903 INFO L354 Elim1Store]: treesize reduction 68, result has 16.0 percent of original size [2021-11-17 00:31:28,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 53 [2021-11-17 00:31:29,080 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-17 00:31:29,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 59 [2021-11-17 00:31:29,097 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-11-17 00:31:29,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 65 [2021-11-17 00:31:29,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2021-11-17 00:31:29,192 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-17 00:31:29,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:31:29,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-11-17 00:31:29,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023072949] [2021-11-17 00:31:29,192 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-17 00:31:29,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-17 00:31:29,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:31:29,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-17 00:31:29,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=618, Unknown=4, NotChecked=0, Total=702 [2021-11-17 00:31:29,193 INFO L87 Difference]: Start difference. First operand 10104 states and 13526 transitions. Second operand has 12 states, 12 states have (on average 10.5) internal successors, (126), 7 states have internal predecessors, (126), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-17 00:31:29,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-17 00:31:29,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=80, Invalid=618, Unknown=4, NotChecked=0, Total=702 [2021-11-17 00:31:29,194 INFO L933 BasicCegarLoop]: 1 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, 1 SdHoareTripleChecker+Invalid, 1 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 [2021-11-17 00:31:29,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:31:29,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:29,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-17 00:31:29,400 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4c7ee33e at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-17 00:31:29,403 INFO L158 Benchmark]: Toolchain (without parser) took 335340.63ms. Allocated memory was 100.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 62.6MB in the beginning and 698.5MB in the end (delta: -635.9MB). Peak memory consumption was 680.0MB. Max. memory is 16.1GB. [2021-11-17 00:31:29,404 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory was 57.4MB in the beginning and 57.4MB in the end (delta: 48.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 00:31:29,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1296.90ms. Allocated memory was 100.7MB in the beginning and 130.0MB in the end (delta: 29.4MB). Free memory was 62.3MB in the beginning and 56.4MB in the end (delta: 5.9MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2021-11-17 00:31:29,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.61ms. Allocated memory is still 130.0MB. Free memory was 56.4MB in the beginning and 73.4MB in the end (delta: -17.0MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2021-11-17 00:31:29,404 INFO L158 Benchmark]: Boogie Preprocessor took 140.30ms. Allocated memory is still 130.0MB. Free memory was 73.4MB in the beginning and 61.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-17 00:31:29,404 INFO L158 Benchmark]: RCFGBuilder took 1540.12ms. Allocated memory was 130.0MB in the beginning and 199.2MB in the end (delta: 69.2MB). Free memory was 61.7MB in the beginning and 86.7MB in the end (delta: -25.0MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2021-11-17 00:31:29,404 INFO L158 Benchmark]: TraceAbstraction took 332234.53ms. Allocated memory was 199.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 85.6MB in the beginning and 698.5MB in the end (delta: -612.8MB). Peak memory consumption was 604.5MB. Max. memory is 16.1GB. [2021-11-17 00:31:29,405 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory was 57.4MB in the beginning and 57.4MB in the end (delta: 48.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1296.90ms. Allocated memory was 100.7MB in the beginning and 130.0MB in the end (delta: 29.4MB). Free memory was 62.3MB in the beginning and 56.4MB in the end (delta: 5.9MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.61ms. Allocated memory is still 130.0MB. Free memory was 56.4MB in the beginning and 73.4MB in the end (delta: -17.0MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.30ms. Allocated memory is still 130.0MB. Free memory was 73.4MB in the beginning and 61.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1540.12ms. Allocated memory was 130.0MB in the beginning and 199.2MB in the end (delta: 69.2MB). Free memory was 61.7MB in the beginning and 86.7MB in the end (delta: -25.0MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * TraceAbstraction took 332234.53ms. Allocated memory was 199.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 85.6MB in the beginning and 698.5MB in the end (delta: -612.8MB). Peak memory consumption was 604.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4c7ee33e de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4c7ee33e: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-17 00:31:29,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 00:31:31,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 00:31:31,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 00:31:31,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 00:31:31,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 00:31:31,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 00:31:31,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 00:31:31,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 00:31:31,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 00:31:31,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 00:31:31,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 00:31:31,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 00:31:31,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 00:31:31,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 00:31:31,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 00:31:31,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 00:31:31,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 00:31:31,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 00:31:31,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 00:31:31,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 00:31:31,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 00:31:31,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 00:31:31,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 00:31:31,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 00:31:31,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 00:31:31,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 00:31:31,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 00:31:31,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 00:31:31,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 00:31:31,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 00:31:31,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 00:31:31,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 00:31:31,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 00:31:31,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 00:31:31,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 00:31:31,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 00:31:31,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 00:31:31,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 00:31:31,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 00:31:31,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 00:31:31,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 00:31:31,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-17 00:31:31,430 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 00:31:31,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 00:31:31,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 00:31:31,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 00:31:31,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 00:31:31,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 00:31:31,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 00:31:31,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 00:31:31,433 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 00:31:31,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 00:31:31,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 00:31:31,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 00:31:31,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 00:31:31,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 00:31:31,434 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-17 00:31:31,435 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-17 00:31:31,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 00:31:31,435 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 00:31:31,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 00:31:31,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 00:31:31,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 00:31:31,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 00:31:31,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:31:31,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 00:31:31,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 00:31:31,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 00:31:31,436 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-17 00:31:31,436 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-17 00:31:31,437 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 00:31:31,437 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 00:31:31,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 00:31:31,437 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 00:31:31,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-17 00:31:31,438 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 [2021-11-17 00:31:31,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 00:31:31,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 00:31:31,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 00:31:31,757 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 00:31:31,759 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 00:31:31,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2021-11-17 00:31:31,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38996fdc5/9ebf599ef4484a64bf583f20d93c5404/FLAG8d4c87de1 [2021-11-17 00:31:32,537 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 00:31:32,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2021-11-17 00:31:32,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38996fdc5/9ebf599ef4484a64bf583f20d93c5404/FLAG8d4c87de1 [2021-11-17 00:31:32,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38996fdc5/9ebf599ef4484a64bf583f20d93c5404 [2021-11-17 00:31:32,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 00:31:32,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 00:31:32,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 00:31:32,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 00:31:32,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 00:31:32,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:31:32" (1/1) ... [2021-11-17 00:31:32,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794df170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:32, skipping insertion in model container [2021-11-17 00:31:32,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:31:32" (1/1) ... [2021-11-17 00:31:32,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 00:31:32,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 00:31:33,286 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/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2021-11-17 00:31:33,609 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:31:33,651 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 00:31:33,768 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/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2021-11-17 00:31:33,892 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:31:34,000 INFO L208 MainTranslator]: Completed translation [2021-11-17 00:31:34,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34 WrapperNode [2021-11-17 00:31:34,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 00:31:34,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 00:31:34,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 00:31:34,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 00:31:34,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (1/1) ... [2021-11-17 00:31:34,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (1/1) ... [2021-11-17 00:31:34,180 INFO L137 Inliner]: procedures = 180, calls = 691, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1716 [2021-11-17 00:31:34,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 00:31:34,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 00:31:34,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 00:31:34,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 00:31:34,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (1/1) ... [2021-11-17 00:31:34,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (1/1) ... [2021-11-17 00:31:34,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (1/1) ... [2021-11-17 00:31:34,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (1/1) ... [2021-11-17 00:31:34,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (1/1) ... [2021-11-17 00:31:34,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (1/1) ... [2021-11-17 00:31:34,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (1/1) ... [2021-11-17 00:31:34,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 00:31:34,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 00:31:34,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 00:31:34,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 00:31:34,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (1/1) ... [2021-11-17 00:31:34,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:31:34,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:31:34,376 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) [2021-11-17 00:31:34,408 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 [2021-11-17 00:31:34,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2021-11-17 00:31:34,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2021-11-17 00:31:34,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-17 00:31:34,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-17 00:31:34,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_8 [2021-11-17 00:31:34,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_8 [2021-11-17 00:31:34,423 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2021-11-17 00:31:34,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2021-11-17 00:31:34,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-17 00:31:34,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2021-11-17 00:31:34,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2021-11-17 00:31:34,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 00:31:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 00:31:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 00:31:34,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 00:31:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-11-17 00:31:34,424 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-11-17 00:31:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2021-11-17 00:31:34,424 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2021-11-17 00:31:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2021-11-17 00:31:34,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2021-11-17 00:31:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2021-11-17 00:31:34,425 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2021-11-17 00:31:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2021-11-17 00:31:34,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2021-11-17 00:31:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 00:31:34,425 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 00:31:34,426 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-11-17 00:31:34,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-11-17 00:31:34,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 00:31:34,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 00:31:34,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2021-11-17 00:31:34,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2021-11-17 00:31:34,426 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2021-11-17 00:31:34,426 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2021-11-17 00:31:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 00:31:34,427 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 00:31:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_disconnect [2021-11-17 00:31:34,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_disconnect [2021-11-17 00:31:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx_timeout [2021-11-17 00:31:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx_timeout [2021-11-17 00:31:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 00:31:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 00:31:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-17 00:31:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-17 00:31:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-17 00:31:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-17 00:31:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 00:31:34,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 00:31:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 00:31:34,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 00:31:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_set [2021-11-17 00:31:34,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_set [2021-11-17 00:31:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-11-17 00:31:34,430 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-11-17 00:31:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 00:31:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2021-11-17 00:31:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2021-11-17 00:31:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 00:31:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 00:31:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 00:31:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_free_urbs [2021-11-17 00:31:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_free_urbs [2021-11-17 00:31:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 00:31:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 00:31:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-17 00:31:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-17 00:31:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 00:31:34,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 00:31:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-17 00:31:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-11-17 00:31:34,434 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-11-17 00:31:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2021-11-17 00:31:34,435 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2021-11-17 00:31:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 00:31:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2021-11-17 00:31:34,435 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2021-11-17 00:31:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-17 00:31:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-17 00:31:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-17 00:31:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 00:31:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-17 00:31:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 00:31:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-17 00:31:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-17 00:31:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-17 00:31:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-17 00:31:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2021-11-17 00:31:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2021-11-17 00:31:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-11-17 00:31:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-11-17 00:31:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-11-17 00:31:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-11-17 00:31:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2021-11-17 00:31:34,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2021-11-17 00:31:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-17 00:31:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2021-11-17 00:31:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2021-11-17 00:31:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 00:31:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 00:31:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2021-11-17 00:31:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2021-11-17 00:31:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 00:31:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 00:31:34,939 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 00:31:34,942 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 00:31:35,175 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 00:31:36,619 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2021-11-17 00:31:38,430 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 00:31:38,439 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 00:31:38,440 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-17 00:31:38,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:31:38 BoogieIcfgContainer [2021-11-17 00:31:38,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 00:31:38,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 00:31:38,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 00:31:38,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 00:31:38,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:31:32" (1/3) ... [2021-11-17 00:31:38,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc21f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:31:38, skipping insertion in model container [2021-11-17 00:31:38,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:34" (2/3) ... [2021-11-17 00:31:38,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc21f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:31:38, skipping insertion in model container [2021-11-17 00:31:38,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:31:38" (3/3) ... [2021-11-17 00:31:38,452 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2021-11-17 00:31:38,456 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 00:31:38,456 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 00:31:38,516 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 00:31:38,525 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 00:31:38,530 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 00:31:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 527 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 405 states have internal predecessors, (503), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2021-11-17 00:31:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-17 00:31:38,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:38,570 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:38,571 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash -60987296, now seen corresponding path program 1 times [2021-11-17 00:31:38,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:38,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991716831] [2021-11-17 00:31:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:38,587 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:38,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:38,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:38,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-17 00:31:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:39,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:31:39,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 00:31:39,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 00:31:39,340 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:31:39,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991716831] [2021-11-17 00:31:39,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991716831] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:31:39,340 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:31:39,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 00:31:39,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969724469] [2021-11-17 00:31:39,343 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:39,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:31:39,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:31:39,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:31:39,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:31:39,368 INFO L87 Difference]: Start difference. First operand has 527 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 405 states have internal predecessors, (503), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:31:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:41,091 INFO L93 Difference]: Finished difference Result 2026 states and 2780 transitions. [2021-11-17 00:31:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:31:41,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2021-11-17 00:31:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:41,113 INFO L225 Difference]: With dead ends: 2026 [2021-11-17 00:31:41,113 INFO L226 Difference]: Without dead ends: 1471 [2021-11-17 00:31:41,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:31:41,121 INFO L933 BasicCegarLoop]: 886 mSDtfsCounter, 1777 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:41,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1777 Valid, 2011 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-17 00:31:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2021-11-17 00:31:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1471. [2021-11-17 00:31:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1095 states have (on average 1.2767123287671234) internal successors, (1398), 1117 states have internal predecessors, (1398), 273 states have call successors, (273), 103 states have call predecessors, (273), 102 states have return successors, (268), 259 states have call predecessors, (268), 268 states have call successors, (268) [2021-11-17 00:31:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1939 transitions. [2021-11-17 00:31:41,305 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1939 transitions. Word has length 34 [2021-11-17 00:31:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:41,306 INFO L470 AbstractCegarLoop]: Abstraction has 1471 states and 1939 transitions. [2021-11-17 00:31:41,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:31:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1939 transitions. [2021-11-17 00:31:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-17 00:31:41,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:41,313 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:41,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:41,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:31:41,530 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash -406405667, now seen corresponding path program 1 times [2021-11-17 00:31:41,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:41,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265760683] [2021-11-17 00:31:41,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:41,532 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:41,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:41,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:41,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-17 00:31:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:41,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:31:41,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:42,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:42,170 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:31:42,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265760683] [2021-11-17 00:31:42,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265760683] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:31:42,170 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:31:42,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 00:31:42,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902501808] [2021-11-17 00:31:42,171 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:42,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:31:42,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:31:42,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:31:42,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:31:42,173 INFO L87 Difference]: Start difference. First operand 1471 states and 1939 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:31:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:42,314 INFO L93 Difference]: Finished difference Result 1497 states and 1971 transitions. [2021-11-17 00:31:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:31:42,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2021-11-17 00:31:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:42,322 INFO L225 Difference]: With dead ends: 1497 [2021-11-17 00:31:42,322 INFO L226 Difference]: Without dead ends: 1484 [2021-11-17 00:31:42,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:31:42,331 INFO L933 BasicCegarLoop]: 690 mSDtfsCounter, 670 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:42,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [670 Valid, 706 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:31:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2021-11-17 00:31:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1471. [2021-11-17 00:31:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1095 states have (on average 1.275799086757991) internal successors, (1397), 1117 states have internal predecessors, (1397), 273 states have call successors, (273), 103 states have call predecessors, (273), 102 states have return successors, (268), 259 states have call predecessors, (268), 268 states have call successors, (268) [2021-11-17 00:31:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1938 transitions. [2021-11-17 00:31:42,418 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1938 transitions. Word has length 44 [2021-11-17 00:31:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:42,418 INFO L470 AbstractCegarLoop]: Abstraction has 1471 states and 1938 transitions. [2021-11-17 00:31:42,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-17 00:31:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1938 transitions. [2021-11-17 00:31:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-17 00:31:42,424 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:42,424 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:42,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:42,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:31:42,641 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash -349147365, now seen corresponding path program 1 times [2021-11-17 00:31:42,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:42,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919564182] [2021-11-17 00:31:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:42,643 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:42,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:42,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:42,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-17 00:31:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:43,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 00:31:43,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:43,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:43,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:31:43,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919564182] [2021-11-17 00:31:43,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919564182] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:31:43,678 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:31:43,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2021-11-17 00:31:43,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947756995] [2021-11-17 00:31:43,678 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:43,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:31:43,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:31:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:31:43,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:31:43,680 INFO L87 Difference]: Start difference. First operand 1471 states and 1938 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 00:31:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:44,255 INFO L93 Difference]: Finished difference Result 4396 states and 5928 transitions. [2021-11-17 00:31:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:31:44,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 44 [2021-11-17 00:31:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:44,270 INFO L225 Difference]: With dead ends: 4396 [2021-11-17 00:31:44,271 INFO L226 Difference]: Without dead ends: 2934 [2021-11-17 00:31:44,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:31:44,276 INFO L933 BasicCegarLoop]: 804 mSDtfsCounter, 1129 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:44,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1129 Valid, 1456 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 00:31:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2021-11-17 00:31:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2922. [2021-11-17 00:31:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2179 states have (on average 1.2739788893988069) internal successors, (2776), 2219 states have internal predecessors, (2776), 538 states have call successors, (538), 205 states have call predecessors, (538), 204 states have return successors, (587), 515 states have call predecessors, (587), 533 states have call successors, (587) [2021-11-17 00:31:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3901 transitions. [2021-11-17 00:31:44,418 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3901 transitions. Word has length 44 [2021-11-17 00:31:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:44,418 INFO L470 AbstractCegarLoop]: Abstraction has 2922 states and 3901 transitions. [2021-11-17 00:31:44,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 00:31:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3901 transitions. [2021-11-17 00:31:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-17 00:31:44,420 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:44,420 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:44,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:44,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:31:44,638 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:44,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2061086592, now seen corresponding path program 1 times [2021-11-17 00:31:44,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:44,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023618529] [2021-11-17 00:31:44,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:44,640 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:44,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:44,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:44,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-17 00:31:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:45,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 00:31:45,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:45,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:45,574 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:31:45,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023618529] [2021-11-17 00:31:45,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023618529] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:31:45,574 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:31:45,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2021-11-17 00:31:45,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932092700] [2021-11-17 00:31:45,574 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:45,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:31:45,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:31:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:31:45,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:31:45,575 INFO L87 Difference]: Start difference. First operand 2922 states and 3901 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 00:31:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:45,985 INFO L93 Difference]: Finished difference Result 2924 states and 3902 transitions. [2021-11-17 00:31:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:31:45,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 45 [2021-11-17 00:31:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:46,000 INFO L225 Difference]: With dead ends: 2924 [2021-11-17 00:31:46,000 INFO L226 Difference]: Without dead ends: 2921 [2021-11-17 00:31:46,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:31:46,002 INFO L933 BasicCegarLoop]: 672 mSDtfsCounter, 1103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:46,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1103 Valid, 672 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 00:31:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2021-11-17 00:31:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2921. [2021-11-17 00:31:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2179 states have (on average 1.2735199632859109) internal successors, (2775), 2218 states have internal predecessors, (2775), 537 states have call successors, (537), 205 states have call predecessors, (537), 204 states have return successors, (587), 515 states have call predecessors, (587), 533 states have call successors, (587) [2021-11-17 00:31:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 3899 transitions. [2021-11-17 00:31:46,149 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 3899 transitions. Word has length 45 [2021-11-17 00:31:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:46,149 INFO L470 AbstractCegarLoop]: Abstraction has 2921 states and 3899 transitions. [2021-11-17 00:31:46,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 00:31:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 3899 transitions. [2021-11-17 00:31:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-17 00:31:46,150 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:46,151 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:46,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:46,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:31:46,368 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash -531067202, now seen corresponding path program 1 times [2021-11-17 00:31:46,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:46,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507797491] [2021-11-17 00:31:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:46,370 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:46,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:46,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:46,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-17 00:31:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:46,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:31:46,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:46,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:47,024 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:31:47,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507797491] [2021-11-17 00:31:47,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507797491] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:31:47,025 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:31:47,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2021-11-17 00:31:47,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63920976] [2021-11-17 00:31:47,025 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:47,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:31:47,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:31:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:31:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:31:47,026 INFO L87 Difference]: Start difference. First operand 2921 states and 3899 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-17 00:31:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:47,136 INFO L93 Difference]: Finished difference Result 2923 states and 3900 transitions. [2021-11-17 00:31:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:31:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 46 [2021-11-17 00:31:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:47,148 INFO L225 Difference]: With dead ends: 2923 [2021-11-17 00:31:47,148 INFO L226 Difference]: Without dead ends: 2920 [2021-11-17 00:31:47,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:31:47,150 INFO L933 BasicCegarLoop]: 670 mSDtfsCounter, 637 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:47,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 670 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:31:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2021-11-17 00:31:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2021-11-17 00:31:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2179 states have (on average 1.273061037173015) internal successors, (2774), 2217 states have internal predecessors, (2774), 536 states have call successors, (536), 205 states have call predecessors, (536), 204 states have return successors, (587), 515 states have call predecessors, (587), 533 states have call successors, (587) [2021-11-17 00:31:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 3897 transitions. [2021-11-17 00:31:47,275 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 3897 transitions. Word has length 46 [2021-11-17 00:31:47,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:47,275 INFO L470 AbstractCegarLoop]: Abstraction has 2920 states and 3897 transitions. [2021-11-17 00:31:47,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-17 00:31:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 3897 transitions. [2021-11-17 00:31:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-17 00:31:47,277 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:47,277 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:47,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:47,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:31:47,492 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash 716548675, now seen corresponding path program 1 times [2021-11-17 00:31:47,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:47,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310742865] [2021-11-17 00:31:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:47,493 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:47,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:47,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:47,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-17 00:31:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:47,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:31:47,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:47,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:48,096 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:31:48,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310742865] [2021-11-17 00:31:48,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310742865] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:31:48,097 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:31:48,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2021-11-17 00:31:48,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811994981] [2021-11-17 00:31:48,097 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:48,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:31:48,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:31:48,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:31:48,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:31:48,098 INFO L87 Difference]: Start difference. First operand 2920 states and 3897 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-17 00:31:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:48,193 INFO L93 Difference]: Finished difference Result 2922 states and 3898 transitions. [2021-11-17 00:31:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:31:48,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 47 [2021-11-17 00:31:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:48,213 INFO L225 Difference]: With dead ends: 2922 [2021-11-17 00:31:48,213 INFO L226 Difference]: Without dead ends: 2919 [2021-11-17 00:31:48,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:31:48,217 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 634 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:48,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 668 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:31:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2021-11-17 00:31:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2919. [2021-11-17 00:31:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2179 states have (on average 1.2726021110601193) internal successors, (2773), 2216 states have internal predecessors, (2773), 535 states have call successors, (535), 205 states have call predecessors, (535), 204 states have return successors, (587), 515 states have call predecessors, (587), 533 states have call successors, (587) [2021-11-17 00:31:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3895 transitions. [2021-11-17 00:31:48,383 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3895 transitions. Word has length 47 [2021-11-17 00:31:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:48,383 INFO L470 AbstractCegarLoop]: Abstraction has 2919 states and 3895 transitions. [2021-11-17 00:31:48,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-17 00:31:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3895 transitions. [2021-11-17 00:31:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-17 00:31:48,384 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:48,385 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:48,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-17 00:31:48,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:31:48,598 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:48,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:48,599 INFO L85 PathProgramCache]: Analyzing trace with hash 737940065, now seen corresponding path program 1 times [2021-11-17 00:31:48,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:48,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054295555] [2021-11-17 00:31:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:48,600 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:48,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:48,600 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:48,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-17 00:31:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:48,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:31:48,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:49,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 00:31:49,167 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:31:49,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054295555] [2021-11-17 00:31:49,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054295555] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:31:49,167 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:31:49,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2021-11-17 00:31:49,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044699524] [2021-11-17 00:31:49,168 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:49,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:31:49,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:31:49,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:31:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:31:49,169 INFO L87 Difference]: Start difference. First operand 2919 states and 3895 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-17 00:31:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:49,296 INFO L93 Difference]: Finished difference Result 2921 states and 3896 transitions. [2021-11-17 00:31:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:31:49,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 48 [2021-11-17 00:31:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:49,309 INFO L225 Difference]: With dead ends: 2921 [2021-11-17 00:31:49,309 INFO L226 Difference]: Without dead ends: 2909 [2021-11-17 00:31:49,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:31:49,311 INFO L933 BasicCegarLoop]: 667 mSDtfsCounter, 631 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 667 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 [2021-11-17 00:31:49,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:31:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2021-11-17 00:31:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2909. [2021-11-17 00:31:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2909 states, 2170 states have (on average 1.2723502304147465) internal successors, (2761), 2206 states have internal predecessors, (2761), 534 states have call successors, (534), 205 states have call predecessors, (534), 204 states have return successors, (587), 515 states have call predecessors, (587), 533 states have call successors, (587) [2021-11-17 00:31:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 3882 transitions. [2021-11-17 00:31:49,489 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 3882 transitions. Word has length 48 [2021-11-17 00:31:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:49,490 INFO L470 AbstractCegarLoop]: Abstraction has 2909 states and 3882 transitions. [2021-11-17 00:31:49,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-17 00:31:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 3882 transitions. [2021-11-17 00:31:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-17 00:31:49,501 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:49,502 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:49,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:49,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:31:49,719 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:49,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:49,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1153772682, now seen corresponding path program 1 times [2021-11-17 00:31:49,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:49,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450633142] [2021-11-17 00:31:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:49,720 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:49,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:49,722 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:49,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-17 00:31:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:50,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:31:50,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-17 00:31:50,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-17 00:31:50,814 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:31:50,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450633142] [2021-11-17 00:31:50,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450633142] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:31:50,814 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:31:50,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 00:31:50,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600987865] [2021-11-17 00:31:50,814 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:50,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:31:50,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:31:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:31:50,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:31:50,815 INFO L87 Difference]: Start difference. First operand 2909 states and 3882 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 00:31:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:51,106 INFO L93 Difference]: Finished difference Result 7846 states and 10407 transitions. [2021-11-17 00:31:51,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:31:51,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 153 [2021-11-17 00:31:51,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:51,138 INFO L225 Difference]: With dead ends: 7846 [2021-11-17 00:31:51,139 INFO L226 Difference]: Without dead ends: 4946 [2021-11-17 00:31:51,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:31:51,149 INFO L933 BasicCegarLoop]: 780 mSDtfsCounter, 457 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:51,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 1419 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:31:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2021-11-17 00:31:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 4936. [2021-11-17 00:31:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4936 states, 3655 states have (on average 1.2703146374829002) internal successors, (4643), 3721 states have internal predecessors, (4643), 895 states have call successors, (895), 386 states have call predecessors, (895), 385 states have return successors, (984), 858 states have call predecessors, (984), 894 states have call successors, (984) [2021-11-17 00:31:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 6522 transitions. [2021-11-17 00:31:51,436 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 6522 transitions. Word has length 153 [2021-11-17 00:31:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:51,437 INFO L470 AbstractCegarLoop]: Abstraction has 4936 states and 6522 transitions. [2021-11-17 00:31:51,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 00:31:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 6522 transitions. [2021-11-17 00:31:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-17 00:31:51,448 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:51,448 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:51,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-17 00:31:51,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:31:51,686 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash 425318257, now seen corresponding path program 1 times [2021-11-17 00:31:51,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:51,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600671666] [2021-11-17 00:31:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:51,688 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:51,690 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:51,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-17 00:31:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:52,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-17 00:31:52,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-17 00:31:52,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-17 00:31:52,986 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:31:52,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600671666] [2021-11-17 00:31:52,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600671666] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 00:31:52,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:31:52,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-11-17 00:31:52,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78207522] [2021-11-17 00:31:52,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:52,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:31:52,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:31:52,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:31:52,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:31:52,988 INFO L87 Difference]: Start difference. First operand 4936 states and 6522 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 00:31:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:53,217 INFO L93 Difference]: Finished difference Result 9892 states and 13108 transitions. [2021-11-17 00:31:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:31:53,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2021-11-17 00:31:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:53,242 INFO L225 Difference]: With dead ends: 9892 [2021-11-17 00:31:53,242 INFO L226 Difference]: Without dead ends: 4960 [2021-11-17 00:31:53,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:31:53,257 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 0 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:53,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2642 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:31:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2021-11-17 00:31:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 4948. [2021-11-17 00:31:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4948 states, 3661 states have (on average 1.2698716197760176) internal successors, (4649), 3733 states have internal predecessors, (4649), 895 states have call successors, (895), 386 states have call predecessors, (895), 391 states have return successors, (1026), 858 states have call predecessors, (1026), 894 states have call successors, (1026) [2021-11-17 00:31:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 6570 transitions. [2021-11-17 00:31:53,534 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 6570 transitions. Word has length 162 [2021-11-17 00:31:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:53,535 INFO L470 AbstractCegarLoop]: Abstraction has 4948 states and 6570 transitions. [2021-11-17 00:31:53,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 00:31:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 6570 transitions. [2021-11-17 00:31:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-17 00:31:53,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:53,546 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:53,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:53,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:31:53,762 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1108398985, now seen corresponding path program 1 times [2021-11-17 00:31:53,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:53,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297705522] [2021-11-17 00:31:53,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:31:53,764 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:53,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:53,765 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:53,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-17 00:31:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:31:54,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-17 00:31:54,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-17 00:31:54,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:31:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-17 00:31:55,056 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:31:55,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297705522] [2021-11-17 00:31:55,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297705522] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 00:31:55,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:31:55,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-11-17 00:31:55,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427266387] [2021-11-17 00:31:55,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:31:55,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:31:55,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:31:55,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:31:55,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:31:55,058 INFO L87 Difference]: Start difference. First operand 4948 states and 6570 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 00:31:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:31:55,497 INFO L93 Difference]: Finished difference Result 11276 states and 15286 transitions. [2021-11-17 00:31:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:31:55,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 168 [2021-11-17 00:31:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:31:55,537 INFO L225 Difference]: With dead ends: 11276 [2021-11-17 00:31:55,537 INFO L226 Difference]: Without dead ends: 6344 [2021-11-17 00:31:55,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:31:55,555 INFO L933 BasicCegarLoop]: 861 mSDtfsCounter, 298 mSDsluCounter, 3093 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 3954 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:31:55,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 3954 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 00:31:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6344 states. [2021-11-17 00:31:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6344 to 4966. [2021-11-17 00:31:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4966 states, 3679 states have (on average 1.2685512367491165) internal successors, (4667), 3745 states have internal predecessors, (4667), 895 states have call successors, (895), 386 states have call predecessors, (895), 391 states have return successors, (1026), 864 states have call predecessors, (1026), 894 states have call successors, (1026) [2021-11-17 00:31:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4966 states to 4966 states and 6588 transitions. [2021-11-17 00:31:55,881 INFO L78 Accepts]: Start accepts. Automaton has 4966 states and 6588 transitions. Word has length 168 [2021-11-17 00:31:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:31:55,882 INFO L470 AbstractCegarLoop]: Abstraction has 4966 states and 6588 transitions. [2021-11-17 00:31:55,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 00:31:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4966 states and 6588 transitions. [2021-11-17 00:31:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-17 00:31:55,900 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:31:55,900 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:31:55,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-17 00:31:56,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:31:56,115 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:31:56,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:31:56,116 INFO L85 PathProgramCache]: Analyzing trace with hash 485316577, now seen corresponding path program 2 times [2021-11-17 00:31:56,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:31:56,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313391550] [2021-11-17 00:31:56,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:31:56,117 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:31:56,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:31:56,118 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:31:56,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-17 00:31:59,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 00:31:59,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:31:59,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-17 00:31:59,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:31:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-17 00:31:59,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:32:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-17 00:32:00,216 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:32:00,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313391550] [2021-11-17 00:32:00,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313391550] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 00:32:00,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:32:00,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-11-17 00:32:00,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936700496] [2021-11-17 00:32:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:32:00,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:32:00,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:32:00,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:32:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:32:00,218 INFO L87 Difference]: Start difference. First operand 4966 states and 6588 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 00:32:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:32:00,668 INFO L93 Difference]: Finished difference Result 12738 states and 17536 transitions. [2021-11-17 00:32:00,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:32:00,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 174 [2021-11-17 00:32:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:32:00,694 INFO L225 Difference]: With dead ends: 12738 [2021-11-17 00:32:00,694 INFO L226 Difference]: Without dead ends: 7788 [2021-11-17 00:32:00,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:32:00,708 INFO L933 BasicCegarLoop]: 903 mSDtfsCounter, 459 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 4266 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:32:00,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 4266 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 00:32:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7788 states. [2021-11-17 00:32:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7788 to 4984. [2021-11-17 00:32:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4984 states, 3697 states have (on average 1.267243711117122) internal successors, (4685), 3757 states have internal predecessors, (4685), 895 states have call successors, (895), 386 states have call predecessors, (895), 391 states have return successors, (1026), 870 states have call predecessors, (1026), 894 states have call successors, (1026) [2021-11-17 00:32:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 6606 transitions. [2021-11-17 00:32:01,024 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 6606 transitions. Word has length 174 [2021-11-17 00:32:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:32:01,024 INFO L470 AbstractCegarLoop]: Abstraction has 4984 states and 6606 transitions. [2021-11-17 00:32:01,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 00:32:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 6606 transitions. [2021-11-17 00:32:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-11-17 00:32:01,036 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:32:01,036 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:32:01,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-17 00:32:01,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:32:01,251 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:32:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:32:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash -175240903, now seen corresponding path program 3 times [2021-11-17 00:32:01,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:32:01,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725982214] [2021-11-17 00:32:01,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-17 00:32:01,253 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:32:01,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:32:01,255 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:32:01,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-17 00:32:04,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-17 00:32:04,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:32:04,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-17 00:32:04,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:32:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-17 00:32:04,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:32:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-17 00:32:05,384 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:32:05,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725982214] [2021-11-17 00:32:05,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725982214] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:32:05,384 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:32:05,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-17 00:32:05,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27528258] [2021-11-17 00:32:05,385 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:32:05,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 00:32:05,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:32:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 00:32:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:32:05,386 INFO L87 Difference]: Start difference. First operand 4984 states and 6606 transitions. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 8 states have internal predecessors, (150), 6 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-17 00:32:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:32:06,248 INFO L93 Difference]: Finished difference Result 10030 states and 13318 transitions. [2021-11-17 00:32:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 00:32:06,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 8 states have internal predecessors, (150), 6 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 5 states have call successors, (22) Word has length 180 [2021-11-17 00:32:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:32:06,268 INFO L225 Difference]: With dead ends: 10030 [2021-11-17 00:32:06,268 INFO L226 Difference]: Without dead ends: 5062 [2021-11-17 00:32:06,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-11-17 00:32:06,284 INFO L933 BasicCegarLoop]: 793 mSDtfsCounter, 1108 mSDsluCounter, 3810 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 4603 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:32:06,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1115 Valid, 4603 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 00:32:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2021-11-17 00:32:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 5023. [2021-11-17 00:32:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5023 states, 3727 states have (on average 1.2667024416420714) internal successors, (4721), 3784 states have internal predecessors, (4721), 901 states have call successors, (901), 386 states have call predecessors, (901), 394 states have return successors, (1038), 882 states have call predecessors, (1038), 900 states have call successors, (1038) [2021-11-17 00:32:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 6660 transitions. [2021-11-17 00:32:06,535 INFO L78 Accepts]: Start accepts. Automaton has 5023 states and 6660 transitions. Word has length 180 [2021-11-17 00:32:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:32:06,536 INFO L470 AbstractCegarLoop]: Abstraction has 5023 states and 6660 transitions. [2021-11-17 00:32:06,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 8 states have internal predecessors, (150), 6 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-17 00:32:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5023 states and 6660 transitions. [2021-11-17 00:32:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-17 00:32:06,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:32:06,548 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:32:06,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-17 00:32:06,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:32:06,767 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:32:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:32:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1850518817, now seen corresponding path program 4 times [2021-11-17 00:32:06,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:32:06,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981355883] [2021-11-17 00:32:06,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-17 00:32:06,769 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:32:06,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:32:06,771 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:32:06,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-17 00:32:07,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-17 00:32:07,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:32:07,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:32:07,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:32:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-17 00:32:07,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:32:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-17 00:32:08,108 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:32:08,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981355883] [2021-11-17 00:32:08,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981355883] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:32:08,108 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:32:08,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 00:32:08,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163145891] [2021-11-17 00:32:08,108 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:32:08,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:32:08,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:32:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:32:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:32:08,109 INFO L87 Difference]: Start difference. First operand 5023 states and 6660 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 00:32:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:32:08,341 INFO L93 Difference]: Finished difference Result 10036 states and 13312 transitions. [2021-11-17 00:32:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:32:08,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 186 [2021-11-17 00:32:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:32:08,358 INFO L225 Difference]: With dead ends: 10036 [2021-11-17 00:32:08,359 INFO L226 Difference]: Without dead ends: 5029 [2021-11-17 00:32:08,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:32:08,371 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 0 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:32:08,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1319 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:32:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2021-11-17 00:32:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5029. [2021-11-17 00:32:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5029 states, 3733 states have (on average 1.2662737744441468) internal successors, (4727), 3790 states have internal predecessors, (4727), 901 states have call successors, (901), 386 states have call predecessors, (901), 394 states have return successors, (1038), 882 states have call predecessors, (1038), 900 states have call successors, (1038) [2021-11-17 00:32:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 6666 transitions. [2021-11-17 00:32:08,617 INFO L78 Accepts]: Start accepts. Automaton has 5029 states and 6666 transitions. Word has length 186 [2021-11-17 00:32:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:32:08,617 INFO L470 AbstractCegarLoop]: Abstraction has 5029 states and 6666 transitions. [2021-11-17 00:32:08,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 00:32:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5029 states and 6666 transitions. [2021-11-17 00:32:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-17 00:32:08,629 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:32:08,629 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:32:08,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-17 00:32:08,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:32:08,851 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:32:08,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:32:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1264242595, now seen corresponding path program 1 times [2021-11-17 00:32:08,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:32:08,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598943933] [2021-11-17 00:32:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:32:08,853 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:32:08,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:32:08,855 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:32:08,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-17 00:32:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:32:09,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-17 00:32:09,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:32:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-11-17 00:32:10,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:32:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-11-17 00:32:10,560 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:32:10,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598943933] [2021-11-17 00:32:10,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598943933] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 00:32:10,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:32:10,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2021-11-17 00:32:10,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471940024] [2021-11-17 00:32:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:32:10,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:32:10,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:32:10,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:32:10,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:32:10,561 INFO L87 Difference]: Start difference. First operand 5029 states and 6666 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 00:32:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:32:11,048 INFO L93 Difference]: Finished difference Result 11738 states and 15904 transitions. [2021-11-17 00:32:11,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:32:11,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 186 [2021-11-17 00:32:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:32:11,070 INFO L225 Difference]: With dead ends: 11738 [2021-11-17 00:32:11,070 INFO L226 Difference]: Without dead ends: 6725 [2021-11-17 00:32:11,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-11-17 00:32:11,087 INFO L933 BasicCegarLoop]: 921 mSDtfsCounter, 397 mSDsluCounter, 4141 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 5062 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:32:11,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 5062 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:32:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2021-11-17 00:32:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 5053. [2021-11-17 00:32:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5053 states, 3757 states have (on average 1.2645727974447698) internal successors, (4751), 3808 states have internal predecessors, (4751), 901 states have call successors, (901), 386 states have call predecessors, (901), 394 states have return successors, (1038), 888 states have call predecessors, (1038), 900 states have call successors, (1038) [2021-11-17 00:32:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5053 states to 5053 states and 6690 transitions. [2021-11-17 00:32:11,399 INFO L78 Accepts]: Start accepts. Automaton has 5053 states and 6690 transitions. Word has length 186 [2021-11-17 00:32:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:32:11,400 INFO L470 AbstractCegarLoop]: Abstraction has 5053 states and 6690 transitions. [2021-11-17 00:32:11,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 00:32:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 5053 states and 6690 transitions. [2021-11-17 00:32:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-17 00:32:11,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:32:11,411 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:32:11,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-17 00:32:11,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:32:11,630 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:32:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:32:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash -494735621, now seen corresponding path program 1 times [2021-11-17 00:32:11,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:32:11,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757761481] [2021-11-17 00:32:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:32:11,632 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:32:11,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:32:11,633 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:32:11,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-17 00:32:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:32:12,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 00:32:12,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:32:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 00:32:12,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:32:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-17 00:32:12,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:32:12,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757761481] [2021-11-17 00:32:12,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757761481] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:32:12,914 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:32:12,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-17 00:32:12,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700856700] [2021-11-17 00:32:12,914 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:32:12,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 00:32:12,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:32:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 00:32:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:32:12,919 INFO L87 Difference]: Start difference. First operand 5053 states and 6690 transitions. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 00:32:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:32:13,749 INFO L93 Difference]: Finished difference Result 15854 states and 22300 transitions. [2021-11-17 00:32:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 00:32:13,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2021-11-17 00:32:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:32:13,785 INFO L225 Difference]: With dead ends: 15854 [2021-11-17 00:32:13,785 INFO L226 Difference]: Without dead ends: 10817 [2021-11-17 00:32:13,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:32:13,800 INFO L933 BasicCegarLoop]: 1180 mSDtfsCounter, 1500 mSDsluCounter, 3827 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 5007 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:32:13,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1557 Valid, 5007 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 00:32:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10817 states. [2021-11-17 00:32:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10817 to 5071. [2021-11-17 00:32:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5071 states, 3775 states have (on average 1.2633112582781456) internal successors, (4769), 3826 states have internal predecessors, (4769), 901 states have call successors, (901), 386 states have call predecessors, (901), 394 states have return successors, (1038), 888 states have call predecessors, (1038), 900 states have call successors, (1038) [2021-11-17 00:32:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 6708 transitions. [2021-11-17 00:32:14,207 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 6708 transitions. Word has length 192 [2021-11-17 00:32:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:32:14,208 INFO L470 AbstractCegarLoop]: Abstraction has 5071 states and 6708 transitions. [2021-11-17 00:32:14,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 00:32:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 6708 transitions. [2021-11-17 00:32:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-11-17 00:32:14,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:32:14,226 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:32:14,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-17 00:32:14,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:32:14,440 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:32:14,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:32:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1546528150, now seen corresponding path program 1 times [2021-11-17 00:32:14,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:32:14,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485382172] [2021-11-17 00:32:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:32:14,441 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:32:14,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:32:14,442 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:32:14,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-17 00:32:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:32:15,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:32:15,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:32:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 00:32:15,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:32:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-17 00:32:15,777 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:32:15,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485382172] [2021-11-17 00:32:15,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485382172] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:32:15,777 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:32:15,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 00:32:15,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13277046] [2021-11-17 00:32:15,777 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:32:15,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:32:15,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:32:15,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:32:15,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:32:15,779 INFO L87 Difference]: Start difference. First operand 5071 states and 6708 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 00:32:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:32:16,153 INFO L93 Difference]: Finished difference Result 11828 states and 15994 transitions. [2021-11-17 00:32:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:32:16,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 202 [2021-11-17 00:32:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:32:16,180 INFO L225 Difference]: With dead ends: 11828 [2021-11-17 00:32:16,181 INFO L226 Difference]: Without dead ends: 6773 [2021-11-17 00:32:16,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:32:16,193 INFO L933 BasicCegarLoop]: 925 mSDtfsCounter, 244 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 2207 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 [2021-11-17 00:32:16,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 2207 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:32:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2021-11-17 00:32:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 5059. [2021-11-17 00:32:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5059 states, 3769 states have (on average 1.2621384982754047) internal successors, (4757), 3820 states have internal predecessors, (4757), 895 states have call successors, (895), 386 states have call predecessors, (895), 394 states have return successors, (1032), 882 states have call predecessors, (1032), 894 states have call successors, (1032) [2021-11-17 00:32:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5059 states to 5059 states and 6684 transitions. [2021-11-17 00:32:16,545 INFO L78 Accepts]: Start accepts. Automaton has 5059 states and 6684 transitions. Word has length 202 [2021-11-17 00:32:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:32:16,546 INFO L470 AbstractCegarLoop]: Abstraction has 5059 states and 6684 transitions. [2021-11-17 00:32:16,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 00:32:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 6684 transitions. [2021-11-17 00:32:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-11-17 00:32:16,558 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:32:16,558 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:32:16,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-17 00:32:16,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:32:16,780 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:32:16,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:32:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash -68436010, now seen corresponding path program 1 times [2021-11-17 00:32:16,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:32:16,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930513043] [2021-11-17 00:32:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:32:16,782 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:32:16,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:32:16,783 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:32:16,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-17 00:32:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:32:17,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 00:32:17,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:32:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 00:32:17,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:32:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-17 00:32:18,225 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:32:18,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930513043] [2021-11-17 00:32:18,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930513043] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:32:18,225 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:32:18,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-17 00:32:18,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812914793] [2021-11-17 00:32:18,226 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:32:18,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:32:18,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:32:18,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:32:18,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:32:18,228 INFO L87 Difference]: Start difference. First operand 5059 states and 6684 transitions. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-17 00:32:19,277 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:32:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:32:23,570 INFO L93 Difference]: Finished difference Result 11864 states and 16288 transitions. [2021-11-17 00:32:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:32:23,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 202 [2021-11-17 00:32:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:32:23,590 INFO L225 Difference]: With dead ends: 11864 [2021-11-17 00:32:23,590 INFO L226 Difference]: Without dead ends: 6821 [2021-11-17 00:32:23,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:32:23,600 INFO L933 BasicCegarLoop]: 919 mSDtfsCounter, 246 mSDsluCounter, 4018 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 4937 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-17 00:32:23,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 4937 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2021-11-17 00:32:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2021-11-17 00:32:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 5095. [2021-11-17 00:32:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 3799 states have (on average 1.2632271650434326) internal successors, (4799), 3856 states have internal predecessors, (4799), 895 states have call successors, (895), 386 states have call predecessors, (895), 400 states have return successors, (1044), 882 states have call predecessors, (1044), 894 states have call successors, (1044) [2021-11-17 00:32:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 6738 transitions. [2021-11-17 00:32:23,910 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 6738 transitions. Word has length 202 [2021-11-17 00:32:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:32:23,910 INFO L470 AbstractCegarLoop]: Abstraction has 5095 states and 6738 transitions. [2021-11-17 00:32:23,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-17 00:32:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 6738 transitions. [2021-11-17 00:32:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-11-17 00:32:23,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:32:23,920 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:32:23,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-17 00:32:24,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:32:24,140 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:32:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:32:24,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1541972954, now seen corresponding path program 1 times [2021-11-17 00:32:24,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:32:24,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117027458] [2021-11-17 00:32:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:32:24,142 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:32:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:32:24,143 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:32:24,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-17 00:32:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:32:24,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-17 00:32:24,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:32:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 00:32:25,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:32:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-17 00:32:25,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:32:25,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117027458] [2021-11-17 00:32:25,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117027458] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:32:25,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:32:25,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-11-17 00:32:25,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577640545] [2021-11-17 00:32:25,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:32:25,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 00:32:25,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:32:25,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 00:32:25,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:32:25,624 INFO L87 Difference]: Start difference. First operand 5095 states and 6738 transitions. Second operand has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-17 00:32:28,747 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:32:32,704 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:32:33,998 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:32:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:32:34,578 INFO L93 Difference]: Finished difference Result 11948 states and 16204 transitions. [2021-11-17 00:32:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:32:34,580 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 203 [2021-11-17 00:32:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:32:34,602 INFO L225 Difference]: With dead ends: 11948 [2021-11-17 00:32:34,603 INFO L226 Difference]: Without dead ends: 6869 [2021-11-17 00:32:34,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:32:34,616 INFO L933 BasicCegarLoop]: 919 mSDtfsCounter, 499 mSDsluCounter, 4295 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 5214 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:32:34,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [546 Valid, 5214 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2021-11-17 00:32:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6869 states. [2021-11-17 00:32:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6869 to 5107. [2021-11-17 00:32:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5107 states, 3811 states have (on average 1.2655471004985568) internal successors, (4823), 3868 states have internal predecessors, (4823), 895 states have call successors, (895), 386 states have call predecessors, (895), 400 states have return successors, (1044), 882 states have call predecessors, (1044), 894 states have call successors, (1044) [2021-11-17 00:32:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 6762 transitions. [2021-11-17 00:32:34,994 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 6762 transitions. Word has length 203 [2021-11-17 00:32:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:32:34,995 INFO L470 AbstractCegarLoop]: Abstraction has 5107 states and 6762 transitions. [2021-11-17 00:32:34,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-17 00:32:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 6762 transitions. [2021-11-17 00:32:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-11-17 00:32:35,006 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:32:35,006 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:32:35,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-17 00:32:35,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:32:35,226 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:32:35,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:32:35,226 INFO L85 PathProgramCache]: Analyzing trace with hash 23022038, now seen corresponding path program 2 times [2021-11-17 00:32:35,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:32:35,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37287568] [2021-11-17 00:32:35,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:32:35,227 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:32:35,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:32:35,228 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:32:35,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-17 00:32:38,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 00:32:38,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:32:38,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-17 00:32:38,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:32:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-17 00:32:39,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:32:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-17 00:32:39,555 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:32:39,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37287568] [2021-11-17 00:32:39,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37287568] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:32:39,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:32:39,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-11-17 00:32:39,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731069156] [2021-11-17 00:32:39,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:32:39,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 00:32:39,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:32:39,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 00:32:39,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:32:39,557 INFO L87 Difference]: Start difference. First operand 5107 states and 6762 transitions. Second operand has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-17 00:32:45,481 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:32:46,645 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:32:48,661 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:32:50,674 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:32:52,619 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:32:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:32:59,031 INFO L93 Difference]: Finished difference Result 12008 states and 16324 transitions. [2021-11-17 00:32:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:32:59,033 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 204 [2021-11-17 00:32:59,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:32:59,049 INFO L225 Difference]: With dead ends: 12008 [2021-11-17 00:32:59,050 INFO L226 Difference]: Without dead ends: 6917 [2021-11-17 00:32:59,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-17 00:32:59,059 INFO L933 BasicCegarLoop]: 920 mSDtfsCounter, 262 mSDsluCounter, 7681 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 8601 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:32:59,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 8601 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 2 Unknown, 0 Unchecked, 19.0s Time] [2021-11-17 00:32:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6917 states. [2021-11-17 00:32:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6917 to 5113. [2021-11-17 00:32:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5113 states, 3817 states have (on average 1.2667015981137018) internal successors, (4835), 3874 states have internal predecessors, (4835), 895 states have call successors, (895), 386 states have call predecessors, (895), 400 states have return successors, (1044), 882 states have call predecessors, (1044), 894 states have call successors, (1044) [2021-11-17 00:32:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5113 states to 5113 states and 6774 transitions. [2021-11-17 00:32:59,357 INFO L78 Accepts]: Start accepts. Automaton has 5113 states and 6774 transitions. Word has length 204 [2021-11-17 00:32:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:32:59,357 INFO L470 AbstractCegarLoop]: Abstraction has 5113 states and 6774 transitions. [2021-11-17 00:32:59,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-17 00:32:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5113 states and 6774 transitions. [2021-11-17 00:32:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-11-17 00:32:59,367 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:32:59,367 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:32:59,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-17 00:32:59,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:32:59,587 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:32:59,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:32:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1293226534, now seen corresponding path program 3 times [2021-11-17 00:32:59,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:32:59,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154843952] [2021-11-17 00:32:59,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-17 00:32:59,589 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:32:59,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:32:59,590 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:32:59,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-17 00:33:02,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-17 00:33:02,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:33:02,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-17 00:33:02,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:33:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-11-17 00:33:03,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:33:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-11-17 00:33:04,178 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:33:04,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154843952] [2021-11-17 00:33:04,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154843952] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:33:04,178 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:33:04,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2021-11-17 00:33:04,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112459379] [2021-11-17 00:33:04,178 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:33:04,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 00:33:04,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:33:04,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 00:33:04,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:33:04,179 INFO L87 Difference]: Start difference. First operand 5113 states and 6774 transitions. Second operand has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 9 states have internal predecessors, (129), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 00:33:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:33:10,620 INFO L93 Difference]: Finished difference Result 14303 states and 19292 transitions. [2021-11-17 00:33:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 00:33:10,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 9 states have internal predecessors, (129), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) Word has length 205 [2021-11-17 00:33:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:33:10,638 INFO L225 Difference]: With dead ends: 14303 [2021-11-17 00:33:10,638 INFO L226 Difference]: Without dead ends: 9196 [2021-11-17 00:33:10,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-11-17 00:33:10,646 INFO L933 BasicCegarLoop]: 983 mSDtfsCounter, 2930 mSDsluCounter, 4942 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 913 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2930 SdHoareTripleChecker+Valid, 5925 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 913 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-11-17 00:33:10,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2930 Valid, 5925 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [913 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2021-11-17 00:33:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9196 states. [2021-11-17 00:33:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9196 to 7182. [2021-11-17 00:33:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7182 states, 5378 states have (on average 1.266084046113797) internal successors, (6809), 5454 states have internal predecessors, (6809), 1241 states have call successors, (1241), 542 states have call predecessors, (1241), 562 states have return successors, (1411), 1228 states have call predecessors, (1411), 1240 states have call successors, (1411) [2021-11-17 00:33:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7182 states to 7182 states and 9461 transitions. [2021-11-17 00:33:11,135 INFO L78 Accepts]: Start accepts. Automaton has 7182 states and 9461 transitions. Word has length 205 [2021-11-17 00:33:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:33:11,136 INFO L470 AbstractCegarLoop]: Abstraction has 7182 states and 9461 transitions. [2021-11-17 00:33:11,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 9 states have internal predecessors, (129), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 00:33:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 7182 states and 9461 transitions. [2021-11-17 00:33:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-11-17 00:33:11,146 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:33:11,146 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:33:11,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-17 00:33:11,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:33:11,367 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:33:11,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:33:11,368 INFO L85 PathProgramCache]: Analyzing trace with hash 387602785, now seen corresponding path program 1 times [2021-11-17 00:33:11,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:33:11,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134792032] [2021-11-17 00:33:11,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:33:11,369 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:33:11,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:33:11,369 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:33:11,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-17 00:33:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:33:12,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-17 00:33:12,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:33:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 63 proven. 6 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-17 00:33:12,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:33:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-11-17 00:33:13,417 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:33:13,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134792032] [2021-11-17 00:33:13,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134792032] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:33:13,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:33:13,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-11-17 00:33:13,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014561187] [2021-11-17 00:33:13,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:33:13,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-17 00:33:13,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:33:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-17 00:33:13,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:33:13,419 INFO L87 Difference]: Start difference. First operand 7182 states and 9461 transitions. Second operand has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2021-11-17 00:33:23,296 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:24,516 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:26,537 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:27,866 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:33,707 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:37,478 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:39,489 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:41,502 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:43,517 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:33:44,557 INFO L93 Difference]: Finished difference Result 17005 states and 23056 transitions. [2021-11-17 00:33:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 00:33:44,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) Word has length 232 [2021-11-17 00:33:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:33:44,579 INFO L225 Difference]: With dead ends: 17005 [2021-11-17 00:33:44,579 INFO L226 Difference]: Without dead ends: 9839 [2021-11-17 00:33:44,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-11-17 00:33:44,588 INFO L933 BasicCegarLoop]: 921 mSDtfsCounter, 293 mSDsluCounter, 4941 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 9 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 5862 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:33:44,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 5862 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 30.5s Time] [2021-11-17 00:33:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9839 states. [2021-11-17 00:33:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9839 to 7191. [2021-11-17 00:33:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7191 states, 5387 states have (on average 1.2673101912010396) internal successors, (6827), 5463 states have internal predecessors, (6827), 1241 states have call successors, (1241), 542 states have call predecessors, (1241), 562 states have return successors, (1411), 1228 states have call predecessors, (1411), 1240 states have call successors, (1411) [2021-11-17 00:33:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7191 states to 7191 states and 9479 transitions. [2021-11-17 00:33:45,048 INFO L78 Accepts]: Start accepts. Automaton has 7191 states and 9479 transitions. Word has length 232 [2021-11-17 00:33:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:33:45,049 INFO L470 AbstractCegarLoop]: Abstraction has 7191 states and 9479 transitions. [2021-11-17 00:33:45,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2021-11-17 00:33:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 7191 states and 9479 transitions. [2021-11-17 00:33:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-11-17 00:33:45,056 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:33:45,056 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:33:45,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-11-17 00:33:45,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:33:45,257 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:33:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:33:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash -993293903, now seen corresponding path program 2 times [2021-11-17 00:33:45,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:33:45,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860137064] [2021-11-17 00:33:45,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:33:45,258 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:33:45,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:33:45,259 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:33:45,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-17 00:33:48,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 00:33:48,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:33:48,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-17 00:33:48,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:33:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 63 proven. 10 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-17 00:33:49,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:33:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-11-17 00:33:50,567 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:33:50,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860137064] [2021-11-17 00:33:50,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860137064] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:33:50,567 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:33:50,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-11-17 00:33:50,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066002207] [2021-11-17 00:33:50,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:33:50,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-17 00:33:50,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:33:50,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-17 00:33:50,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-11-17 00:33:50,570 INFO L87 Difference]: Start difference. First operand 7191 states and 9479 transitions. Second operand has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2021-11-17 00:33:53,367 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:55,386 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:57,406 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:33:59,421 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:34:01,436 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:34:02,571 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:34:05,462 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:34:17,625 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:34:19,091 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:34:21,108 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:34:23,121 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:34:24,334 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:34:29,611 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:34:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:34:33,166 INFO L93 Difference]: Finished difference Result 17082 states and 23210 transitions. [2021-11-17 00:34:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 00:34:33,168 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) Word has length 233 [2021-11-17 00:34:33,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:34:33,192 INFO L225 Difference]: With dead ends: 17082 [2021-11-17 00:34:33,192 INFO L226 Difference]: Without dead ends: 9907 [2021-11-17 00:34:33,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-11-17 00:34:33,204 INFO L933 BasicCegarLoop]: 922 mSDtfsCounter, 323 mSDsluCounter, 6780 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 14 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 7702 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.9s IncrementalHoareTripleChecker+Time [2021-11-17 00:34:33,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 7702 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 304 Invalid, 8 Unknown, 0 Unchecked, 41.9s Time] [2021-11-17 00:34:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2021-11-17 00:34:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 7200. [2021-11-17 00:34:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 5396 states have (on average 1.2685322461082282) internal successors, (6845), 5472 states have internal predecessors, (6845), 1241 states have call successors, (1241), 542 states have call predecessors, (1241), 562 states have return successors, (1411), 1228 states have call predecessors, (1411), 1240 states have call successors, (1411) [2021-11-17 00:34:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9497 transitions. [2021-11-17 00:34:33,649 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9497 transitions. Word has length 233 [2021-11-17 00:34:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:34:33,649 INFO L470 AbstractCegarLoop]: Abstraction has 7200 states and 9497 transitions. [2021-11-17 00:34:33,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2021-11-17 00:34:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9497 transitions. [2021-11-17 00:34:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-11-17 00:34:33,656 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:34:33,657 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:34:33,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-11-17 00:34:33,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:34:33,865 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:34:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:34:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash -851418271, now seen corresponding path program 3 times [2021-11-17 00:34:33,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:34:33,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723629097] [2021-11-17 00:34:33,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-17 00:34:33,867 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:34:33,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:34:33,868 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:34:33,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-17 00:34:37,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-17 00:34:37,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:34:37,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-17 00:34:37,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:34:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-11-17 00:34:37,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:34:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-11-17 00:34:37,931 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:34:37,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723629097] [2021-11-17 00:34:37,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723629097] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:34:37,932 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:34:37,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-17 00:34:37,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362911444] [2021-11-17 00:34:37,932 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:34:37,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 00:34:37,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:34:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 00:34:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:34:37,933 INFO L87 Difference]: Start difference. First operand 7200 states and 9497 transitions. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 4 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-17 00:34:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:34:44,856 INFO L93 Difference]: Finished difference Result 35048 states and 48058 transitions. [2021-11-17 00:34:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-17 00:34:44,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 4 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 234 [2021-11-17 00:34:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:34:44,942 INFO L225 Difference]: With dead ends: 35048 [2021-11-17 00:34:44,943 INFO L226 Difference]: Without dead ends: 27864 [2021-11-17 00:34:44,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2021-11-17 00:34:44,964 INFO L933 BasicCegarLoop]: 1927 mSDtfsCounter, 3395 mSDsluCounter, 10124 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3396 SdHoareTripleChecker+Valid, 12051 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:34:44,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3396 Valid, 12051 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-11-17 00:34:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27864 states. [2021-11-17 00:34:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27864 to 12136. [2021-11-17 00:34:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12136 states, 9091 states have (on average 1.2672973270267298) internal successors, (11521), 9227 states have internal predecessors, (11521), 2086 states have call successors, (2086), 923 states have call predecessors, (2086), 958 states have return successors, (2400), 2055 states have call predecessors, (2400), 2085 states have call successors, (2400) [2021-11-17 00:34:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12136 states to 12136 states and 16007 transitions. [2021-11-17 00:34:45,972 INFO L78 Accepts]: Start accepts. Automaton has 12136 states and 16007 transitions. Word has length 234 [2021-11-17 00:34:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:34:45,973 INFO L470 AbstractCegarLoop]: Abstraction has 12136 states and 16007 transitions. [2021-11-17 00:34:45,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 4 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-17 00:34:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 12136 states and 16007 transitions. [2021-11-17 00:34:45,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-11-17 00:34:45,988 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:34:45,989 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:34:46,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-11-17 00:34:46,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:34:46,189 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:34:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:34:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1862535521, now seen corresponding path program 1 times [2021-11-17 00:34:46,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:34:46,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298199754] [2021-11-17 00:34:46,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:34:46,191 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:34:46,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:34:46,192 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:34:46,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-17 00:34:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:34:47,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-17 00:34:47,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:34:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-17 00:34:47,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:34:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-11-17 00:34:49,013 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:34:49,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298199754] [2021-11-17 00:34:49,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298199754] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:34:49,013 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:34:49,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-11-17 00:34:49,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223282580] [2021-11-17 00:34:49,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:34:49,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-17 00:34:49,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:34:49,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-17 00:34:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-11-17 00:34:49,015 INFO L87 Difference]: Start difference. First operand 12136 states and 16007 transitions. Second operand has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2021-11-17 00:34:52,784 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:00,832 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:02,852 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:04,863 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:06,088 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:09,485 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:13,166 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:18,545 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:20,402 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:24,453 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:26,470 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:28,223 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:29,537 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:30,623 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:32,577 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:35,402 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:35:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:35:46,143 INFO L93 Difference]: Finished difference Result 28101 states and 38088 transitions. [2021-11-17 00:35:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 00:35:46,144 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) Word has length 234 [2021-11-17 00:35:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:35:46,190 INFO L225 Difference]: With dead ends: 28101 [2021-11-17 00:35:46,190 INFO L226 Difference]: Without dead ends: 15981 [2021-11-17 00:35:46,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-11-17 00:35:46,212 INFO L933 BasicCegarLoop]: 922 mSDtfsCounter, 568 mSDsluCounter, 9802 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 71 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 10724 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:35:46,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 10724 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 441 Invalid, 5 Unknown, 0 Unchecked, 55.8s Time] [2021-11-17 00:35:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15981 states. [2021-11-17 00:35:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15981 to 12151. [2021-11-17 00:35:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12151 states, 9106 states have (on average 1.2685042828904018) internal successors, (11551), 9242 states have internal predecessors, (11551), 2086 states have call successors, (2086), 923 states have call predecessors, (2086), 958 states have return successors, (2400), 2055 states have call predecessors, (2400), 2085 states have call successors, (2400) [2021-11-17 00:35:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12151 states to 12151 states and 16037 transitions. [2021-11-17 00:35:47,145 INFO L78 Accepts]: Start accepts. Automaton has 12151 states and 16037 transitions. Word has length 234 [2021-11-17 00:35:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:35:47,146 INFO L470 AbstractCegarLoop]: Abstraction has 12151 states and 16037 transitions. [2021-11-17 00:35:47,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2021-11-17 00:35:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 12151 states and 16037 transitions. [2021-11-17 00:35:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2021-11-17 00:35:47,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:35:47,162 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:35:47,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-11-17 00:35:47,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:35:47,368 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:35:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:35:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1759358225, now seen corresponding path program 2 times [2021-11-17 00:35:47,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:35:47,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635810698] [2021-11-17 00:35:47,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:35:47,370 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:35:47,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:35:47,371 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:35:47,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-11-17 00:35:51,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 00:35:51,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:35:51,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 1389 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 00:35:51,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:35:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-11-17 00:35:51,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:35:52,044 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-11-17 00:35:52,045 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:35:52,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635810698] [2021-11-17 00:35:52,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635810698] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:35:52,045 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:35:52,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-17 00:35:52,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237963490] [2021-11-17 00:35:52,045 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:35:52,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:35:52,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:35:52,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:35:52,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:35:52,046 INFO L87 Difference]: Start difference. First operand 12151 states and 16037 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2021-11-17 00:35:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:35:54,450 INFO L93 Difference]: Finished difference Result 27730 states and 37370 transitions. [2021-11-17 00:35:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:35:54,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) Word has length 235 [2021-11-17 00:35:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:35:54,485 INFO L225 Difference]: With dead ends: 27730 [2021-11-17 00:35:54,485 INFO L226 Difference]: Without dead ends: 15595 [2021-11-17 00:35:54,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:35:54,502 INFO L933 BasicCegarLoop]: 919 mSDtfsCounter, 247 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 4017 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:35:54,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 4017 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-17 00:35:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15595 states. [2021-11-17 00:35:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15595 to 12166. [2021-11-17 00:35:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12166 states, 9121 states have (on average 1.2697072689398092) internal successors, (11581), 9257 states have internal predecessors, (11581), 2086 states have call successors, (2086), 923 states have call predecessors, (2086), 958 states have return successors, (2400), 2055 states have call predecessors, (2400), 2085 states have call successors, (2400) [2021-11-17 00:35:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12166 states to 12166 states and 16067 transitions. [2021-11-17 00:35:55,349 INFO L78 Accepts]: Start accepts. Automaton has 12166 states and 16067 transitions. Word has length 235 [2021-11-17 00:35:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:35:55,349 INFO L470 AbstractCegarLoop]: Abstraction has 12166 states and 16067 transitions. [2021-11-17 00:35:55,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2021-11-17 00:35:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 12166 states and 16067 transitions. [2021-11-17 00:35:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-11-17 00:35:55,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:35:55,366 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:35:55,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-11-17 00:35:55,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:35:55,579 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:35:55,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:35:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1342627683, now seen corresponding path program 1 times [2021-11-17 00:35:55,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:35:55,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186856747] [2021-11-17 00:35:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:35:55,581 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:35:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:35:55,583 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:35:55,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-11-17 00:35:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:35:56,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 1396 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-17 00:35:56,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:35:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 37 proven. 9 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2021-11-17 00:35:57,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:36:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-11-17 00:36:00,261 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:36:00,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186856747] [2021-11-17 00:36:00,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186856747] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:36:00,261 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:36:00,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-11-17 00:36:00,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097088383] [2021-11-17 00:36:00,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:36:00,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-17 00:36:00,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:36:00,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-17 00:36:00,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2021-11-17 00:36:00,263 INFO L87 Difference]: Start difference. First operand 12166 states and 16067 transitions. Second operand has 26 states, 25 states have (on average 6.84) internal successors, (171), 20 states have internal predecessors, (171), 9 states have call successors, (31), 4 states have call predecessors, (31), 9 states have return successors, (33), 14 states have call predecessors, (33), 9 states have call successors, (33) [2021-11-17 00:36:06,993 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:08,215 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:10,084 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:12,828 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:13,842 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:15,746 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:17,034 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:18,711 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:19,802 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:21,080 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:23,955 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:25,959 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:40,605 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:36:51,307 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:37:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:37:18,999 INFO L93 Difference]: Finished difference Result 34232 states and 46816 transitions. [2021-11-17 00:37:19,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-17 00:37:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 6.84) internal successors, (171), 20 states have internal predecessors, (171), 9 states have call successors, (31), 4 states have call predecessors, (31), 9 states have return successors, (33), 14 states have call predecessors, (33), 9 states have call successors, (33) Word has length 236 [2021-11-17 00:37:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:37:19,054 INFO L225 Difference]: With dead ends: 34232 [2021-11-17 00:37:19,054 INFO L226 Difference]: Without dead ends: 22082 [2021-11-17 00:37:19,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=317, Invalid=2545, Unknown=0, NotChecked=0, Total=2862 [2021-11-17 00:37:19,072 INFO L933 BasicCegarLoop]: 1554 mSDtfsCounter, 3942 mSDsluCounter, 24514 mSDsCounter, 0 mSdLazyCounter, 10116 mSolverCounterSat, 1213 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4082 SdHoareTripleChecker+Valid, 26068 SdHoareTripleChecker+Invalid, 11330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1213 IncrementalHoareTripleChecker+Valid, 10116 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:37:19,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4082 Valid, 26068 Invalid, 11330 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1213 Valid, 10116 Invalid, 1 Unknown, 0 Unchecked, 73.8s Time] [2021-11-17 00:37:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22082 states. [2021-11-17 00:37:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22082 to 12601. [2021-11-17 00:37:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12601 states, 9400 states have (on average 1.2620212765957446) internal successors, (11863), 9548 states have internal predecessors, (11863), 2146 states have call successors, (2146), 923 states have call predecessors, (2146), 1054 states have return successors, (2460), 2199 states have call predecessors, (2460), 2145 states have call successors, (2460) [2021-11-17 00:37:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12601 states to 12601 states and 16469 transitions. [2021-11-17 00:37:20,086 INFO L78 Accepts]: Start accepts. Automaton has 12601 states and 16469 transitions. Word has length 236 [2021-11-17 00:37:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:37:20,086 INFO L470 AbstractCegarLoop]: Abstraction has 12601 states and 16469 transitions. [2021-11-17 00:37:20,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 6.84) internal successors, (171), 20 states have internal predecessors, (171), 9 states have call successors, (31), 4 states have call predecessors, (31), 9 states have return successors, (33), 14 states have call predecessors, (33), 9 states have call successors, (33) [2021-11-17 00:37:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 12601 states and 16469 transitions. [2021-11-17 00:37:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-11-17 00:37:20,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:37:20,098 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:37:20,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-11-17 00:37:20,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:37:20,299 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:37:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:37:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1023740250, now seen corresponding path program 1 times [2021-11-17 00:37:20,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:37:20,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313907281] [2021-11-17 00:37:20,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:37:20,301 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:37:20,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:37:20,302 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:37:20,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-11-17 00:37:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:37:21,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-17 00:37:21,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:37:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2021-11-17 00:37:22,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:37:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-11-17 00:37:22,905 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:37:22,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313907281] [2021-11-17 00:37:22,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313907281] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 00:37:22,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:37:22,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2021-11-17 00:37:22,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083391950] [2021-11-17 00:37:22,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:37:22,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:37:22,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:37:22,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:37:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:37:22,906 INFO L87 Difference]: Start difference. First operand 12601 states and 16469 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 00:37:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:37:24,166 INFO L93 Difference]: Finished difference Result 27204 states and 35942 transitions. [2021-11-17 00:37:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:37:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) Word has length 252 [2021-11-17 00:37:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:37:24,200 INFO L225 Difference]: With dead ends: 27204 [2021-11-17 00:37:24,201 INFO L226 Difference]: Without dead ends: 14619 [2021-11-17 00:37:24,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:37:24,220 INFO L933 BasicCegarLoop]: 944 mSDtfsCounter, 233 mSDsluCounter, 4452 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 5396 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:37:24,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 5396 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:37:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14619 states. [2021-11-17 00:37:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14619 to 12631. [2021-11-17 00:37:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12631 states, 9424 states have (on average 1.2613539898132429) internal successors, (11887), 9566 states have internal predecessors, (11887), 2146 states have call successors, (2146), 923 states have call predecessors, (2146), 1060 states have return successors, (2472), 2211 states have call predecessors, (2472), 2145 states have call successors, (2472) [2021-11-17 00:37:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12631 states to 12631 states and 16505 transitions. [2021-11-17 00:37:25,182 INFO L78 Accepts]: Start accepts. Automaton has 12631 states and 16505 transitions. Word has length 252 [2021-11-17 00:37:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:37:25,182 INFO L470 AbstractCegarLoop]: Abstraction has 12631 states and 16505 transitions. [2021-11-17 00:37:25,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 00:37:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 12631 states and 16505 transitions. [2021-11-17 00:37:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-11-17 00:37:25,194 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:37:25,194 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:37:25,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-11-17 00:37:25,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:37:25,395 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:37:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:37:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1400644622, now seen corresponding path program 2 times [2021-11-17 00:37:25,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:37:25,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467741245] [2021-11-17 00:37:25,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:37:25,397 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:37:25,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:37:25,398 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:37:25,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-11-17 00:37:29,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 00:37:29,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:37:29,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-17 00:37:29,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:37:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2021-11-17 00:37:30,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:37:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2021-11-17 00:37:31,348 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:37:31,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467741245] [2021-11-17 00:37:31,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467741245] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:37:31,349 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:37:31,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-17 00:37:31,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135044538] [2021-11-17 00:37:31,349 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:37:31,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-17 00:37:31,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:37:31,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-17 00:37:31,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:37:31,350 INFO L87 Difference]: Start difference. First operand 12631 states and 16505 transitions. Second operand has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 8 states have internal predecessors, (146), 2 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 6 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 00:37:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:37:33,368 INFO L93 Difference]: Finished difference Result 29128 states and 38828 transitions. [2021-11-17 00:37:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 00:37:33,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 8 states have internal predecessors, (146), 2 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 6 states have call predecessors, (27), 2 states have call successors, (27) Word has length 258 [2021-11-17 00:37:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:37:33,399 INFO L225 Difference]: With dead ends: 29128 [2021-11-17 00:37:33,399 INFO L226 Difference]: Without dead ends: 16513 [2021-11-17 00:37:33,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:37:33,414 INFO L933 BasicCegarLoop]: 987 mSDtfsCounter, 700 mSDsluCounter, 6808 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 7795 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:37:33,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 7795 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 00:37:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16513 states. [2021-11-17 00:37:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16513 to 12643. [2021-11-17 00:37:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12643 states, 9436 states have (on average 1.2610216193302246) internal successors, (11899), 9572 states have internal predecessors, (11899), 2146 states have call successors, (2146), 923 states have call predecessors, (2146), 1060 states have return successors, (2472), 2217 states have call predecessors, (2472), 2145 states have call successors, (2472) [2021-11-17 00:37:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12643 states to 12643 states and 16517 transitions. [2021-11-17 00:37:34,414 INFO L78 Accepts]: Start accepts. Automaton has 12643 states and 16517 transitions. Word has length 258 [2021-11-17 00:37:34,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:37:34,415 INFO L470 AbstractCegarLoop]: Abstraction has 12643 states and 16517 transitions. [2021-11-17 00:37:34,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 8 states have internal predecessors, (146), 2 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 6 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 00:37:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 12643 states and 16517 transitions. [2021-11-17 00:37:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-11-17 00:37:34,427 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:37:34,427 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:37:34,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-11-17 00:37:34,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:37:34,629 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:37:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:37:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1709478774, now seen corresponding path program 3 times [2021-11-17 00:37:34,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:37:34,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629994946] [2021-11-17 00:37:34,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-17 00:37:34,631 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:37:34,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:37:34,632 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:37:34,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-11-17 00:37:38,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-17 00:37:38,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:37:38,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 00:37:38,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:37:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2021-11-17 00:37:39,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:37:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2021-11-17 00:37:39,643 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:37:39,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629994946] [2021-11-17 00:37:39,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629994946] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:37:39,644 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:37:39,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-17 00:37:39,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007365333] [2021-11-17 00:37:39,644 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:37:39,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:37:39,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:37:39,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:37:39,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:37:39,646 INFO L87 Difference]: Start difference. First operand 12643 states and 16517 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 00:37:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:37:41,250 INFO L93 Difference]: Finished difference Result 29330 states and 39230 transitions. [2021-11-17 00:37:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:37:41,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 264 [2021-11-17 00:37:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:37:41,290 INFO L225 Difference]: With dead ends: 29330 [2021-11-17 00:37:41,290 INFO L226 Difference]: Without dead ends: 16703 [2021-11-17 00:37:41,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:37:41,312 INFO L933 BasicCegarLoop]: 976 mSDtfsCounter, 546 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:37:41,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 2544 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 00:37:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16703 states. [2021-11-17 00:37:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16703 to 12643. [2021-11-17 00:37:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12643 states, 9436 states have (on average 1.260385756676558) internal successors, (11893), 9572 states have internal predecessors, (11893), 2146 states have call successors, (2146), 923 states have call predecessors, (2146), 1060 states have return successors, (2472), 2217 states have call predecessors, (2472), 2145 states have call successors, (2472) [2021-11-17 00:37:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12643 states to 12643 states and 16511 transitions. [2021-11-17 00:37:42,410 INFO L78 Accepts]: Start accepts. Automaton has 12643 states and 16511 transitions. Word has length 264 [2021-11-17 00:37:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:37:42,410 INFO L470 AbstractCegarLoop]: Abstraction has 12643 states and 16511 transitions. [2021-11-17 00:37:42,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 00:37:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 12643 states and 16511 transitions. [2021-11-17 00:37:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-11-17 00:37:42,423 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:37:42,424 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:37:42,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-11-17 00:37:42,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:37:42,624 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:37:42,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:37:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1046623794, now seen corresponding path program 1 times [2021-11-17 00:37:42,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:37:42,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566945798] [2021-11-17 00:37:42,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:37:42,626 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:37:42,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:37:42,627 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:37:42,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-11-17 00:37:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:37:43,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 1533 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 00:37:43,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:37:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-11-17 00:37:44,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:37:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2021-11-17 00:37:45,624 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:37:45,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566945798] [2021-11-17 00:37:45,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566945798] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:37:45,624 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:37:45,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-17 00:37:45,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045051450] [2021-11-17 00:37:45,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:37:45,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:37:45,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:37:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:37:45,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:37:45,626 INFO L87 Difference]: Start difference. First operand 12643 states and 16511 transitions. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 4 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2021-11-17 00:37:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:37:54,421 INFO L93 Difference]: Finished difference Result 75771 states and 98958 transitions. [2021-11-17 00:37:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:37:54,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 4 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 267 [2021-11-17 00:37:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:37:54,634 INFO L225 Difference]: With dead ends: 75771 [2021-11-17 00:37:54,634 INFO L226 Difference]: Without dead ends: 75763 [2021-11-17 00:37:54,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:37:54,661 INFO L933 BasicCegarLoop]: 1641 mSDtfsCounter, 3941 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3941 SdHoareTripleChecker+Valid, 3664 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:37:54,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3941 Valid, 3664 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-11-17 00:37:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75763 states. [2021-11-17 00:38:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75763 to 75650. [2021-11-17 00:38:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75650 states, 56443 states have (on average 1.2608826603830412) internal successors, (71168), 57289 states have internal predecessors, (71168), 12851 states have call successors, (12851), 5528 states have call predecessors, (12851), 6355 states have return successors, (14812), 13252 states have call predecessors, (14812), 12850 states have call successors, (14812) [2021-11-17 00:38:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75650 states to 75650 states and 98831 transitions. [2021-11-17 00:38:01,288 INFO L78 Accepts]: Start accepts. Automaton has 75650 states and 98831 transitions. Word has length 267 [2021-11-17 00:38:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:38:01,289 INFO L470 AbstractCegarLoop]: Abstraction has 75650 states and 98831 transitions. [2021-11-17 00:38:01,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 4 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2021-11-17 00:38:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 75650 states and 98831 transitions. [2021-11-17 00:38:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-11-17 00:38:01,363 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:38:01,363 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:38:01,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-11-17 00:38:01,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:38:01,564 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:38:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:38:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2057741044, now seen corresponding path program 1 times [2021-11-17 00:38:01,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:38:01,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685288812] [2021-11-17 00:38:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:38:01,566 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:38:01,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:38:01,567 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:38:01,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-11-17 00:38:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:38:03,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 00:38:03,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:38:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2021-11-17 00:38:03,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:38:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2021-11-17 00:38:03,897 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:38:03,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685288812] [2021-11-17 00:38:03,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685288812] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:38:03,898 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:38:03,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-17 00:38:03,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125709288] [2021-11-17 00:38:03,898 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:38:03,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:38:03,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:38:03,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:38:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:38:03,900 INFO L87 Difference]: Start difference. First operand 75650 states and 98831 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2021-11-17 00:38:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:38:10,499 INFO L93 Difference]: Finished difference Result 155498 states and 204057 transitions. [2021-11-17 00:38:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:38:10,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 267 [2021-11-17 00:38:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:38:10,756 INFO L225 Difference]: With dead ends: 155498 [2021-11-17 00:38:10,757 INFO L226 Difference]: Without dead ends: 79864 [2021-11-17 00:38:10,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:38:10,922 INFO L933 BasicCegarLoop]: 915 mSDtfsCounter, 823 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:38:10,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [823 Valid, 2325 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 00:38:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79864 states.