./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--cdc_mbim.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--cdc_mbim.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 a9a20f3f691c8614da828fa262b8d39a0b290d1ce7d7bab1e11653a91cb5fcdd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 00:25:21,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 00:25:21,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 00:25:21,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 00:25:21,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 00:25:21,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 00:25:21,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 00:25:21,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 00:25:21,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 00:25:21,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 00:25:21,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 00:25:21,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 00:25:21,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 00:25:21,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 00:25:21,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 00:25:21,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 00:25:21,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 00:25:21,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 00:25:21,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 00:25:21,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 00:25:21,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 00:25:21,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 00:25:21,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 00:25:21,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 00:25:21,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 00:25:21,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 00:25:21,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 00:25:21,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 00:25:21,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 00:25:21,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 00:25:21,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 00:25:21,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 00:25:21,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 00:25:21,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 00:25:21,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 00:25:21,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 00:25:21,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 00:25:21,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 00:25:21,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 00:25:21,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 00:25:21,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 00:25:21,772 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:21,800 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 00:25:21,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 00:25:21,803 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 00:25:21,803 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 00:25:21,804 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 00:25:21,804 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 00:25:21,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 00:25:21,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 00:25:21,805 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 00:25:21,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 00:25:21,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 00:25:21,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 00:25:21,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 00:25:21,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 00:25:21,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 00:25:21,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 00:25:21,807 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 00:25:21,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 00:25:21,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 00:25:21,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 00:25:21,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 00:25:21,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:25:21,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 00:25:21,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 00:25:21,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 00:25:21,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 00:25:21,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 00:25:21,810 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 00:25:21,810 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 00:25:21,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 00:25:21,810 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 00:25:21,810 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 -> a9a20f3f691c8614da828fa262b8d39a0b290d1ce7d7bab1e11653a91cb5fcdd [2021-11-17 00:25:22,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 00:25:22,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 00:25:22,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 00:25:22,059 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 00:25:22,060 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 00:25:22,061 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--cdc_mbim.ko-entry_point.cil.out.i [2021-11-17 00:25:22,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c3c0014/847326f819fe42eba5ced0b23680cf0c/FLAGc49b4c78b [2021-11-17 00:25:22,739 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 00:25:22,740 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--cdc_mbim.ko-entry_point.cil.out.i [2021-11-17 00:25:22,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c3c0014/847326f819fe42eba5ced0b23680cf0c/FLAGc49b4c78b [2021-11-17 00:25:23,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c3c0014/847326f819fe42eba5ced0b23680cf0c [2021-11-17 00:25:23,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 00:25:23,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 00:25:23,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 00:25:23,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 00:25:23,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 00:25:23,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:25:23" (1/1) ... [2021-11-17 00:25:23,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d64f75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:23, skipping insertion in model container [2021-11-17 00:25:23,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:25:23" (1/1) ... [2021-11-17 00:25:23,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 00:25:23,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 00:25:23,805 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--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2021-11-17 00:25:24,046 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:25:24,072 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 00:25:24,192 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--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2021-11-17 00:25:24,296 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:25:24,346 INFO L208 MainTranslator]: Completed translation [2021-11-17 00:25:24,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:24 WrapperNode [2021-11-17 00:25:24,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 00:25:24,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 00:25:24,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 00:25:24,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 00:25:24,354 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:24" (1/1) ... [2021-11-17 00:25:24,407 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:24" (1/1) ... [2021-11-17 00:25:24,510 INFO L137 Inliner]: procedures = 139, calls = 575, calls flagged for inlining = 59, calls inlined = 59, statements flattened = 1721 [2021-11-17 00:25:24,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 00:25:24,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 00:25:24,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 00:25:24,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 00:25:24,519 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:24" (1/1) ... [2021-11-17 00:25:24,520 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:24" (1/1) ... [2021-11-17 00:25:24,543 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:24" (1/1) ... [2021-11-17 00:25:24,546 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:24" (1/1) ... [2021-11-17 00:25:24,606 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:24" (1/1) ... [2021-11-17 00:25:24,629 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:24" (1/1) ... [2021-11-17 00:25:24,645 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:24" (1/1) ... [2021-11-17 00:25:24,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 00:25:24,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 00:25:24,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 00:25:24,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 00:25:24,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:24" (1/1) ... [2021-11-17 00:25:24,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:25:24,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:25:24,697 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:24,719 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:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_resume [2021-11-17 00:25:24,741 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_resume [2021-11-17 00:25:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 00:25:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 00:25:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 00:25:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 00:25:24,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 00:25:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 00:25:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2021-11-17 00:25:24,742 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2021-11-17 00:25:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2021-11-17 00:25:24,742 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2021-11-17 00:25:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 00:25:24,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 00:25:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 00:25:24,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 00:25:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2021-11-17 00:25:24,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2021-11-17 00:25:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 00:25:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_suspend [2021-11-17 00:25:24,743 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_suspend [2021-11-17 00:25:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 00:25:24,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 00:25:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_resume [2021-11-17 00:25:24,744 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_resume [2021-11-17 00:25:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 00:25:24,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 00:25:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-11-17 00:25:24,745 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-11-17 00:25:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 00:25:24,745 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 00:25:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 00:25:24,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 00:25:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_tx_fixup [2021-11-17 00:25:24,745 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_tx_fixup [2021-11-17 00:25:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 00:25:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2021-11-17 00:25:24,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2021-11-17 00:25:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2021-11-17 00:25:24,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2021-11-17 00:25:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 00:25:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 00:25:24,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 00:25:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 00:25:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 00:25:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 00:25:24,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 00:25:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_bind [2021-11-17 00:25:24,748 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_bind [2021-11-17 00:25:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_manage_power [2021-11-17 00:25:24,748 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_manage_power [2021-11-17 00:25:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-11-17 00:25:24,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-11-17 00:25:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 00:25:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2021-11-17 00:25:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 00:25:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 00:25:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2021-11-17 00:25:24,750 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2021-11-17 00:25:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_rx_fixup [2021-11-17 00:25:24,751 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_rx_fixup [2021-11-17 00:25:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2021-11-17 00:25:24,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2021-11-17 00:25:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_ncm_unbind [2021-11-17 00:25:24,752 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_ncm_unbind [2021-11-17 00:25:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_unbind [2021-11-17 00:25:24,752 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_unbind [2021-11-17 00:25:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 00:25:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2021-11-17 00:25:24,752 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2021-11-17 00:25:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 00:25:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 00:25:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 00:25:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 00:25:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 00:25:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure eth_hdr [2021-11-17 00:25:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_hdr [2021-11-17 00:25:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2021-11-17 00:25:24,754 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2021-11-17 00:25:25,222 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 00:25:25,224 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 00:25:25,874 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 00:25:26,125 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2021-11-17 00:25:26,441 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 00:25:26,450 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 00:25:26,450 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-17 00:25:26,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:25:26 BoogieIcfgContainer [2021-11-17 00:25:26,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 00:25:26,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 00:25:26,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 00:25:26,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 00:25:26,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:25:23" (1/3) ... [2021-11-17 00:25:26,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc2319a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:25:26, skipping insertion in model container [2021-11-17 00:25:26,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:24" (2/3) ... [2021-11-17 00:25:26,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc2319a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:25:26, skipping insertion in model container [2021-11-17 00:25:26,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:25:26" (3/3) ... [2021-11-17 00:25:26,458 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2021-11-17 00:25:26,462 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 00:25:26,462 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 00:25:26,503 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 00:25:26,508 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:26,508 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 00:25:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 523 states, 398 states have (on average 1.407035175879397) internal successors, (560), 412 states have internal predecessors, (560), 94 states have call successors, (94), 31 states have call predecessors, (94), 29 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2021-11-17 00:25:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-17 00:25:26,539 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:26,540 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, 1, 1, 1, 1, 1, 1] [2021-11-17 00:25:26,543 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:26,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:26,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1589467643, now seen corresponding path program 1 times [2021-11-17 00:25:26,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:26,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78379981] [2021-11-17 00:25:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:26,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:27,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:27,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:27,113 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:27,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:27,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78379981] [2021-11-17 00:25:27,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78379981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:27,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:27,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:25:27,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413450856] [2021-11-17 00:25:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:27,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:25:27,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:27,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:25:27,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:25:27,153 INFO L87 Difference]: Start difference. First operand has 523 states, 398 states have (on average 1.407035175879397) internal successors, (560), 412 states have internal predecessors, (560), 94 states have call successors, (94), 31 states have call predecessors, (94), 29 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 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:25:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:28,844 INFO L93 Difference]: Finished difference Result 1672 states and 2474 transitions. [2021-11-17 00:25:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:25:28,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 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 40 [2021-11-17 00:25:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:28,864 INFO L225 Difference]: With dead ends: 1672 [2021-11-17 00:25:28,864 INFO L226 Difference]: Without dead ends: 1132 [2021-11-17 00:25:28,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:25:28,874 INFO L933 BasicCegarLoop]: 753 mSDtfsCounter, 1145 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:28,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1201 Valid, 2236 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-17 00:25:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2021-11-17 00:25:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 969. [2021-11-17 00:25:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 753 states have (on average 1.3957503320053122) internal successors, (1051), 760 states have internal predecessors, (1051), 159 states have call successors, (159), 57 states have call predecessors, (159), 56 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2021-11-17 00:25:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1363 transitions. [2021-11-17 00:25:29,021 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1363 transitions. Word has length 40 [2021-11-17 00:25:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:29,022 INFO L470 AbstractCegarLoop]: Abstraction has 969 states and 1363 transitions. [2021-11-17 00:25:29,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 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:25:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1363 transitions. [2021-11-17 00:25:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-17 00:25:29,034 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:29,034 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:25:29,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 00:25:29,036 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:29,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1949626109, now seen corresponding path program 1 times [2021-11-17 00:25:29,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:29,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698293793] [2021-11-17 00:25:29,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:29,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:29,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:29,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:29,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-17 00:25:29,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:29,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698293793] [2021-11-17 00:25:29,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698293793] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:29,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:29,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:25:29,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956566023] [2021-11-17 00:25:29,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:29,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:25:29,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:29,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:25:29,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:25:29,281 INFO L87 Difference]: Start difference. First operand 969 states and 1363 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-17 00:25:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:30,157 INFO L93 Difference]: Finished difference Result 1131 states and 1631 transitions. [2021-11-17 00:25:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:25:30,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2021-11-17 00:25:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:30,164 INFO L225 Difference]: With dead ends: 1131 [2021-11-17 00:25:30,165 INFO L226 Difference]: Without dead ends: 1128 [2021-11-17 00:25:30,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:25:30,166 INFO L933 BasicCegarLoop]: 653 mSDtfsCounter, 948 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:30,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1000 Valid, 1470 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-17 00:25:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2021-11-17 00:25:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 968. [2021-11-17 00:25:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 753 states have (on average 1.3944223107569722) internal successors, (1050), 759 states have internal predecessors, (1050), 158 states have call successors, (158), 57 states have call predecessors, (158), 56 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2021-11-17 00:25:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1361 transitions. [2021-11-17 00:25:30,215 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1361 transitions. Word has length 50 [2021-11-17 00:25:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:30,216 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1361 transitions. [2021-11-17 00:25:30,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-17 00:25:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1361 transitions. [2021-11-17 00:25:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-17 00:25:30,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:30,219 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:25:30,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 00:25:30,220 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash 308647439, now seen corresponding path program 1 times [2021-11-17 00:25:30,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:30,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644064646] [2021-11-17 00:25:30,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:30,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:30,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:30,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:30,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-17 00:25:30,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:30,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644064646] [2021-11-17 00:25:30,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644064646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:30,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:30,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:25:30,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344942186] [2021-11-17 00:25:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:30,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:25:30,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:25:30,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:25:30,373 INFO L87 Difference]: Start difference. First operand 968 states and 1361 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-17 00:25:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:31,247 INFO L93 Difference]: Finished difference Result 1130 states and 1629 transitions. [2021-11-17 00:25:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:25:31,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-11-17 00:25:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:31,255 INFO L225 Difference]: With dead ends: 1130 [2021-11-17 00:25:31,255 INFO L226 Difference]: Without dead ends: 1127 [2021-11-17 00:25:31,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:25:31,257 INFO L933 BasicCegarLoop]: 651 mSDtfsCounter, 945 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:31,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [997 Valid, 1466 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-17 00:25:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2021-11-17 00:25:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 967. [2021-11-17 00:25:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 753 states have (on average 1.3930942895086322) internal successors, (1049), 758 states have internal predecessors, (1049), 157 states have call successors, (157), 57 states have call predecessors, (157), 56 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2021-11-17 00:25:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1359 transitions. [2021-11-17 00:25:31,308 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1359 transitions. Word has length 51 [2021-11-17 00:25:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:31,309 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1359 transitions. [2021-11-17 00:25:31,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-17 00:25:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1359 transitions. [2021-11-17 00:25:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-17 00:25:31,312 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:31,312 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:25:31,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 00:25:31,312 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:31,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash 977921088, now seen corresponding path program 1 times [2021-11-17 00:25:31,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:31,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921798669] [2021-11-17 00:25:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:31,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:31,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:31,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-17 00:25:31,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:31,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921798669] [2021-11-17 00:25:31,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921798669] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:31,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:31,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:25:31,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149722915] [2021-11-17 00:25:31,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:31,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:25:31,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:31,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:25:31,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:25:31,438 INFO L87 Difference]: Start difference. First operand 967 states and 1359 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-17 00:25:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:32,295 INFO L93 Difference]: Finished difference Result 1129 states and 1627 transitions. [2021-11-17 00:25:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:25:32,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-11-17 00:25:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:32,302 INFO L225 Difference]: With dead ends: 1129 [2021-11-17 00:25:32,302 INFO L226 Difference]: Without dead ends: 1126 [2021-11-17 00:25:32,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:25:32,304 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 942 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:32,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [994 Valid, 1462 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-17 00:25:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2021-11-17 00:25:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 966. [2021-11-17 00:25:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 753 states have (on average 1.3917662682602923) internal successors, (1048), 757 states have internal predecessors, (1048), 156 states have call successors, (156), 57 states have call predecessors, (156), 56 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2021-11-17 00:25:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1357 transitions. [2021-11-17 00:25:32,351 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1357 transitions. Word has length 52 [2021-11-17 00:25:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:32,352 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1357 transitions. [2021-11-17 00:25:32,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-17 00:25:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1357 transitions. [2021-11-17 00:25:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-17 00:25:32,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:32,354 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:25:32,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 00:25:32,355 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash 250572594, now seen corresponding path program 1 times [2021-11-17 00:25:32,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:32,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938313951] [2021-11-17 00:25:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:32,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:32,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:32,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:32,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-17 00:25:32,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:32,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938313951] [2021-11-17 00:25:32,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938313951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:32,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:32,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:25:32,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906572111] [2021-11-17 00:25:32,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:32,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:25:32,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:32,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:25:32,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:25:32,490 INFO L87 Difference]: Start difference. First operand 966 states and 1357 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-17 00:25:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:33,830 INFO L93 Difference]: Finished difference Result 3187 states and 4578 transitions. [2021-11-17 00:25:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:25:33,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2021-11-17 00:25:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:33,842 INFO L225 Difference]: With dead ends: 3187 [2021-11-17 00:25:33,843 INFO L226 Difference]: Without dead ends: 2232 [2021-11-17 00:25:33,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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:25:33,848 INFO L933 BasicCegarLoop]: 741 mSDtfsCounter, 1173 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:33,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1234 Valid, 2211 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 00:25:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2021-11-17 00:25:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1908. [2021-11-17 00:25:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1490 states have (on average 1.393959731543624) internal successors, (2077), 1496 states have internal predecessors, (2077), 305 states have call successors, (305), 113 states have call predecessors, (305), 112 states have return successors, (310), 302 states have call predecessors, (310), 302 states have call successors, (310) [2021-11-17 00:25:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2692 transitions. [2021-11-17 00:25:33,955 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2692 transitions. Word has length 53 [2021-11-17 00:25:33,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:33,957 INFO L470 AbstractCegarLoop]: Abstraction has 1908 states and 2692 transitions. [2021-11-17 00:25:33,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-17 00:25:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2692 transitions. [2021-11-17 00:25:33,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-17 00:25:33,960 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:33,960 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:25:33,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 00:25:33,961 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:33,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash -822389373, now seen corresponding path program 1 times [2021-11-17 00:25:33,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:33,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498828277] [2021-11-17 00:25:33,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:33,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:34,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:34,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-17 00:25:34,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:34,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498828277] [2021-11-17 00:25:34,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498828277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:34,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:34,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:25:34,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873476054] [2021-11-17 00:25:34,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:34,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:25:34,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:34,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:25:34,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:25:34,091 INFO L87 Difference]: Start difference. First operand 1908 states and 2692 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-17 00:25:34,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:34,944 INFO L93 Difference]: Finished difference Result 2230 states and 3223 transitions. [2021-11-17 00:25:34,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:25:34,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2021-11-17 00:25:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:34,956 INFO L225 Difference]: With dead ends: 2230 [2021-11-17 00:25:34,956 INFO L226 Difference]: Without dead ends: 2218 [2021-11-17 00:25:34,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:25:34,958 INFO L933 BasicCegarLoop]: 648 mSDtfsCounter, 938 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:34,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [990 Valid, 1461 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-17 00:25:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2021-11-17 00:25:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1898. [2021-11-17 00:25:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1481 states have (on average 1.3936529372045916) internal successors, (2064), 1486 states have internal predecessors, (2064), 304 states have call successors, (304), 113 states have call predecessors, (304), 112 states have return successors, (310), 302 states have call predecessors, (310), 302 states have call successors, (310) [2021-11-17 00:25:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2678 transitions. [2021-11-17 00:25:35,042 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2678 transitions. Word has length 54 [2021-11-17 00:25:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:35,042 INFO L470 AbstractCegarLoop]: Abstraction has 1898 states and 2678 transitions. [2021-11-17 00:25:35,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-17 00:25:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2678 transitions. [2021-11-17 00:25:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-17 00:25:35,045 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:35,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 00:25:35,046 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:35,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:35,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1986046453, now seen corresponding path program 1 times [2021-11-17 00:25:35,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:35,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031882158] [2021-11-17 00:25:35,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:35,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:35,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:35,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:35,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 00:25:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:35,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:25:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:35,135 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:35,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:35,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031882158] [2021-11-17 00:25:35,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031882158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:35,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:35,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:25:35,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002225253] [2021-11-17 00:25:35,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:35,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:25:35,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:35,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:25:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:25:35,137 INFO L87 Difference]: Start difference. First operand 1898 states and 2678 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-17 00:25:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:36,547 INFO L93 Difference]: Finished difference Result 6142 states and 8755 transitions. [2021-11-17 00:25:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:25:36,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2021-11-17 00:25:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:36,573 INFO L225 Difference]: With dead ends: 6142 [2021-11-17 00:25:36,574 INFO L226 Difference]: Without dead ends: 4255 [2021-11-17 00:25:36,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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:25:36,586 INFO L933 BasicCegarLoop]: 705 mSDtfsCounter, 1124 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:36,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1181 Valid, 2111 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 00:25:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2021-11-17 00:25:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 3604. [2021-11-17 00:25:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 2825 states have (on average 1.390796460176991) internal successors, (3929), 2834 states have internal predecessors, (3929), 555 states have call successors, (555), 224 states have call predecessors, (555), 223 states have return successors, (565), 553 states have call predecessors, (565), 553 states have call successors, (565) [2021-11-17 00:25:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 5049 transitions. [2021-11-17 00:25:36,773 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 5049 transitions. Word has length 66 [2021-11-17 00:25:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:36,773 INFO L470 AbstractCegarLoop]: Abstraction has 3604 states and 5049 transitions. [2021-11-17 00:25:36,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-17 00:25:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 5049 transitions. [2021-11-17 00:25:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-17 00:25:36,776 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:36,776 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, 1, 1, 1, 1, 1, 1, 1, 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:36,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 00:25:36,776 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:36,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash -181003579, now seen corresponding path program 1 times [2021-11-17 00:25:36,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:36,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568785468] [2021-11-17 00:25:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:36,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:36,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 00:25:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 00:25:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:36,868 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:36,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:36,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568785468] [2021-11-17 00:25:36,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568785468] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:36,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:36,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:25:36,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665293839] [2021-11-17 00:25:36,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:36,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:25:36,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:25:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:25:36,871 INFO L87 Difference]: Start difference. First operand 3604 states and 5049 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-17 00:25:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:38,473 INFO L93 Difference]: Finished difference Result 10431 states and 14766 transitions. [2021-11-17 00:25:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:25:38,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2021-11-17 00:25:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:38,524 INFO L225 Difference]: With dead ends: 10431 [2021-11-17 00:25:38,525 INFO L226 Difference]: Without dead ends: 6848 [2021-11-17 00:25:38,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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:25:38,544 INFO L933 BasicCegarLoop]: 1049 mSDtfsCounter, 962 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 2902 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:38,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1022 Valid, 2902 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-17 00:25:38,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2021-11-17 00:25:38,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 5818. [2021-11-17 00:25:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5818 states, 4560 states have (on average 1.3888157894736841) internal successors, (6333), 4575 states have internal predecessors, (6333), 882 states have call successors, (882), 376 states have call predecessors, (882), 375 states have return successors, (896), 878 states have call predecessors, (896), 880 states have call successors, (896) [2021-11-17 00:25:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 8111 transitions. [2021-11-17 00:25:38,863 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 8111 transitions. Word has length 65 [2021-11-17 00:25:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:38,865 INFO L470 AbstractCegarLoop]: Abstraction has 5818 states and 8111 transitions. [2021-11-17 00:25:38,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-17 00:25:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 8111 transitions. [2021-11-17 00:25:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-17 00:25:38,875 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:38,875 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 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] [2021-11-17 00:25:38,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 00:25:38,875 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1535676253, now seen corresponding path program 1 times [2021-11-17 00:25:38,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:38,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431469913] [2021-11-17 00:25:38,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:38,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:25:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 00:25:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 00:25:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 00:25:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 00:25:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:25:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 00:25:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 00:25:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 00:25:39,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:39,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431469913] [2021-11-17 00:25:39,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431469913] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:39,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:39,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 00:25:39,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677803146] [2021-11-17 00:25:39,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:39,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:25:39,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:39,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:25:39,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:25:39,134 INFO L87 Difference]: Start difference. First operand 5818 states and 8111 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-17 00:25:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:41,554 INFO L93 Difference]: Finished difference Result 10230 states and 14590 transitions. [2021-11-17 00:25:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 00:25:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2021-11-17 00:25:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:41,608 INFO L225 Difference]: With dead ends: 10230 [2021-11-17 00:25:41,608 INFO L226 Difference]: Without dead ends: 10227 [2021-11-17 00:25:41,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:25:41,614 INFO L933 BasicCegarLoop]: 1327 mSDtfsCounter, 2079 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 3956 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:41,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2185 Valid, 3956 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-17 00:25:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10227 states. [2021-11-17 00:25:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10227 to 8696. [2021-11-17 00:25:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8696 states, 6817 states have (on average 1.3902009681678158) internal successors, (9477), 6839 states have internal predecessors, (9477), 1318 states have call successors, (1318), 561 states have call predecessors, (1318), 560 states have return successors, (1364), 1313 states have call predecessors, (1364), 1316 states have call successors, (1364) [2021-11-17 00:25:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8696 states to 8696 states and 12159 transitions. [2021-11-17 00:25:42,050 INFO L78 Accepts]: Start accepts. Automaton has 8696 states and 12159 transitions. Word has length 122 [2021-11-17 00:25:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:42,050 INFO L470 AbstractCegarLoop]: Abstraction has 8696 states and 12159 transitions. [2021-11-17 00:25:42,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-17 00:25:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 8696 states and 12159 transitions. [2021-11-17 00:25:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-17 00:25:42,058 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:42,058 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 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] [2021-11-17 00:25:42,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 00:25:42,059 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:42,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1504761742, now seen corresponding path program 1 times [2021-11-17 00:25:42,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:42,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853542453] [2021-11-17 00:25:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:42,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:25:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 00:25:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 00:25:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 00:25:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 00:25:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:25:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-17 00:25:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 00:25:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-11-17 00:25:42,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:42,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853542453] [2021-11-17 00:25:42,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853542453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:42,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:42,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:25:42,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414647371] [2021-11-17 00:25:42,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:42,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:25:42,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:42,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:25:42,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:25:42,224 INFO L87 Difference]: Start difference. First operand 8696 states and 12159 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-17 00:25:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:43,852 INFO L93 Difference]: Finished difference Result 24686 states and 34978 transitions. [2021-11-17 00:25:43,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:25:43,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2021-11-17 00:25:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:43,921 INFO L225 Difference]: With dead ends: 24686 [2021-11-17 00:25:43,921 INFO L226 Difference]: Without dead ends: 16027 [2021-11-17 00:25:43,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:25:43,954 INFO L933 BasicCegarLoop]: 860 mSDtfsCounter, 1082 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:43,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1140 Valid, 2458 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-17 00:25:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16027 states. [2021-11-17 00:25:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16027 to 13615. [2021-11-17 00:25:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13615 states, 10743 states have (on average 1.385832635204319) internal successors, (14888), 10774 states have internal predecessors, (14888), 1996 states have call successors, (1996), 876 states have call predecessors, (1996), 875 states have return successors, (2054), 1988 states have call predecessors, (2054), 1994 states have call successors, (2054) [2021-11-17 00:25:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13615 states to 13615 states and 18938 transitions. [2021-11-17 00:25:44,647 INFO L78 Accepts]: Start accepts. Automaton has 13615 states and 18938 transitions. Word has length 123 [2021-11-17 00:25:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:44,647 INFO L470 AbstractCegarLoop]: Abstraction has 13615 states and 18938 transitions. [2021-11-17 00:25:44,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-17 00:25:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 13615 states and 18938 transitions. [2021-11-17 00:25:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-17 00:25:44,653 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:44,653 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 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] [2021-11-17 00:25:44,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 00:25:44,653 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1949944417, now seen corresponding path program 1 times [2021-11-17 00:25:44,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:44,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773803350] [2021-11-17 00:25:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:44,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:25:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 00:25:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 00:25:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 00:25:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 00:25:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:25:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 00:25:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 00:25:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 00:25:44,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:44,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773803350] [2021-11-17 00:25:44,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773803350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:44,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:44,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 00:25:44,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164695879] [2021-11-17 00:25:44,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:44,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 00:25:44,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:44,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 00:25:44,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:25:44,841 INFO L87 Difference]: Start difference. First operand 13615 states and 18938 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-17 00:25:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:46,412 INFO L93 Difference]: Finished difference Result 20835 states and 29445 transitions. [2021-11-17 00:25:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 00:25:46,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2021-11-17 00:25:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:46,481 INFO L225 Difference]: With dead ends: 20835 [2021-11-17 00:25:46,482 INFO L226 Difference]: Without dead ends: 16267 [2021-11-17 00:25:46,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-11-17 00:25:46,507 INFO L933 BasicCegarLoop]: 655 mSDtfsCounter, 272 mSDsluCounter, 3838 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 4493 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:46,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 4493 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-17 00:25:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16267 states. [2021-11-17 00:25:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16267 to 13754. [2021-11-17 00:25:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13754 states, 10862 states have (on average 1.380684956729884) internal successors, (14997), 10913 states have internal predecessors, (14997), 1996 states have call successors, (1996), 876 states have call predecessors, (1996), 895 states have return successors, (2094), 1988 states have call predecessors, (2094), 1994 states have call successors, (2094) [2021-11-17 00:25:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 19087 transitions. [2021-11-17 00:25:47,136 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 19087 transitions. Word has length 122 [2021-11-17 00:25:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:47,136 INFO L470 AbstractCegarLoop]: Abstraction has 13754 states and 19087 transitions. [2021-11-17 00:25:47,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-17 00:25:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 19087 transitions. [2021-11-17 00:25:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-17 00:25:47,150 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:47,150 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 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] [2021-11-17 00:25:47,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 00:25:47,150 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1749310071, now seen corresponding path program 1 times [2021-11-17 00:25:47,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:47,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468080522] [2021-11-17 00:25:47,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:47,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:25:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 00:25:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 00:25:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 00:25:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 00:25:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:25:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 00:25:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:25:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 00:25:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-11-17 00:25:47,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:47,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468080522] [2021-11-17 00:25:47,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468080522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:47,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:47,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 00:25:47,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754983315] [2021-11-17 00:25:47,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:47,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:25:47,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:47,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:25:47,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:25:47,379 INFO L87 Difference]: Start difference. First operand 13754 states and 19087 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-17 00:25:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:49,231 INFO L93 Difference]: Finished difference Result 38432 states and 54071 transitions. [2021-11-17 00:25:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:25:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 141 [2021-11-17 00:25:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:49,324 INFO L225 Difference]: With dead ends: 38432 [2021-11-17 00:25:49,325 INFO L226 Difference]: Without dead ends: 24715 [2021-11-17 00:25:49,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:25:49,372 INFO L933 BasicCegarLoop]: 843 mSDtfsCounter, 1197 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:49,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1257 Valid, 2391 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 00:25:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24715 states. [2021-11-17 00:25:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24715 to 21044. [2021-11-17 00:25:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21044 states, 16733 states have (on average 1.3772784318412716) internal successors, (23046), 16802 states have internal predecessors, (23046), 2944 states have call successors, (2944), 1335 states have call predecessors, (2944), 1366 states have return successors, (3062), 2936 states have call predecessors, (3062), 2942 states have call successors, (3062) [2021-11-17 00:25:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21044 states to 21044 states and 29052 transitions. [2021-11-17 00:25:50,387 INFO L78 Accepts]: Start accepts. Automaton has 21044 states and 29052 transitions. Word has length 141 [2021-11-17 00:25:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:50,388 INFO L470 AbstractCegarLoop]: Abstraction has 21044 states and 29052 transitions. [2021-11-17 00:25:50,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-17 00:25:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 21044 states and 29052 transitions. [2021-11-17 00:25:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-17 00:25:50,400 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:50,400 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 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] [2021-11-17 00:25:50,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 00:25:50,401 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:50,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1038448743, now seen corresponding path program 1 times [2021-11-17 00:25:50,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:50,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910481564] [2021-11-17 00:25:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:50,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:25:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 00:25:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 00:25:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 00:25:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 00:25:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:25:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 00:25:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:25:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 00:25:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 00:25:50,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:50,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910481564] [2021-11-17 00:25:50,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910481564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:50,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:25:50,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 00:25:50,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138268842] [2021-11-17 00:25:50,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:50,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 00:25:50,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:50,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 00:25:50,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:25:50,688 INFO L87 Difference]: Start difference. First operand 21044 states and 29052 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-17 00:25:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:52,298 INFO L93 Difference]: Finished difference Result 30746 states and 42907 transitions. [2021-11-17 00:25:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 00:25:52,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 140 [2021-11-17 00:25:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:52,365 INFO L225 Difference]: With dead ends: 30746 [2021-11-17 00:25:52,365 INFO L226 Difference]: Without dead ends: 16636 [2021-11-17 00:25:52,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:25:52,409 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 309 mSDsluCounter, 3091 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 3740 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:52,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 3740 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-17 00:25:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2021-11-17 00:25:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 14099. [2021-11-17 00:25:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14099 states, 11225 states have (on average 1.3730066815144766) internal successors, (15412), 11266 states have internal predecessors, (15412), 1966 states have call successors, (1966), 892 states have call predecessors, (1966), 907 states have return successors, (2012), 1960 states have call predecessors, (2012), 1964 states have call successors, (2012) [2021-11-17 00:25:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14099 states to 14099 states and 19390 transitions. [2021-11-17 00:25:53,074 INFO L78 Accepts]: Start accepts. Automaton has 14099 states and 19390 transitions. Word has length 140 [2021-11-17 00:25:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:53,075 INFO L470 AbstractCegarLoop]: Abstraction has 14099 states and 19390 transitions. [2021-11-17 00:25:53,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-17 00:25:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 14099 states and 19390 transitions. [2021-11-17 00:25:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-17 00:25:53,088 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:25:53,089 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 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] [2021-11-17 00:25:53,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 00:25:53,089 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:25:53,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:25:53,090 INFO L85 PathProgramCache]: Analyzing trace with hash 935962192, now seen corresponding path program 1 times [2021-11-17 00:25:53,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:25:53,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068722295] [2021-11-17 00:25:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:53,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:25:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:25:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 00:25:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 00:25:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 00:25:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 00:25:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:25:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 00:25:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 00:25:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 00:25:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 00:25:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:25:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 00:25:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:25:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 00:25:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2021-11-17 00:25:53,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:25:53,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068722295] [2021-11-17 00:25:53,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068722295] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:25:53,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656958637] [2021-11-17 00:25:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:25:53,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:25:53,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:25:53,350 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:25:53,379 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:25:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:25:53,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-17 00:25:53,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:25:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 00:25:54,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 00:25:54,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656958637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:25:54,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:25:54,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2021-11-17 00:25:54,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494884552] [2021-11-17 00:25:54,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:25:54,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 00:25:54,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:25:54,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 00:25:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:25:54,253 INFO L87 Difference]: Start difference. First operand 14099 states and 19390 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 00:25:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:25:55,563 INFO L93 Difference]: Finished difference Result 14099 states and 19390 transitions. [2021-11-17 00:25:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:25:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 144 [2021-11-17 00:25:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:25:55,565 INFO L225 Difference]: With dead ends: 14099 [2021-11-17 00:25:55,565 INFO L226 Difference]: Without dead ends: 0 [2021-11-17 00:25:55,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-17 00:25:55,587 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 1279 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:25:55,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1307 Valid, 1197 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-17 00:25:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-17 00:25:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-17 00:25:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-17 00:25:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-17 00:25:55,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2021-11-17 00:25:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:25:55,590 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-17 00:25:55,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 00:25:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-17 00:25:55,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-17 00:25:55,592 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-17 00:25:55,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-17 00:25:55,818 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,SelfDestructingSolverStorable13 [2021-11-17 00:25:55,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-17 00:26:01,242 WARN L227 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 62 DAG size of output: 60 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) Killed by 15